Definition

A Linked List is a data structure where each node contains data and a pointer to the next node. Unlike arrays, nodes are not stored contiguously in memory, making middle insertion/deletion efficient.

Key Characteristics

• ✓Dynamic Size: Unlike arrays, size is not fixed and grows as needed.
• ✓Node Structure: Each node consists of [data | next pointer].
• ✓head/tail: Pointers to the start (head) and end (tail) of the list.
• ✓Sequential Access: Cannot access by index directly; must traverse from head.

Time Complexity