• each node is composed of two parts
  • item — the content of the node
    • could be as simple as a single value, or as complex as another data structure
  • next — the address in memory to the next node in the list
  • prev — the address in memory to the previous node in the list (only used in doubly linked list)
• we have a head pointer to keep the address in memory of the first node of the list
• for certain implementations, we keep the address in memory of the last node in the list in a pointer called tail

Singly Linked List

Doubly Linked List

Linked List vs. Array