๐Ÿงพ List (programming)

= linear graph with exactly 1 entry and exit node, used to connect data structures of any type

Terminology

  • HeadNode/FootNode: first/last node
  • SuccNode/PredNode: next/previous node
  • NextNode/CurrNode: periviously/currently viewed node

Subtypes

  • Stacks: Last-In-First-Out, only access to latest element (push, pop)
  • Buffer: First-In-Last-Out, only access to oldest element (enqueue, dequeue)

Comparison

โ†’ ๐Ÿ’ฅ Arrays Vs Lists