Guided Notes

Linked Lists

Nodes and pointers, how linked lists sit in memory, singly/doubly/circular lists, and their operations.

What is a linked list?

Slide 1 / 5

A linked list is a chain of nodes. Each node holds a value and a reference (pointer) to the next node; the list itself only remembers the first node, the head. The last node points to nothing (None).

class Node: def __init__(self, value): self.value = value self.next = None

Unlike an array, nodes can live anywhere in memory — the links hold them together.

← Searching: Linear & Binary Search