Linked Lists, Stacks, Queues & Two-Pointer Patterns
Construct Singly/Doubly Linked Lists, Stacks (LIFO), Queues (FIFO), and solve array problems using Two-Pointers & Sliding Window.
Linear Data Structure Architectures
### Data Structure Tradeoffs
- **Singly Linked List**: Pointer nodes holding `value` and `next`. $O(1)$ insertion at head, $O(N)$ random lookup access.
- **Stack (LIFO)**: Last-In, First-Out collection supporting $O(1)$ `push()` and `pop()`.
- **Queue (FIFO)**: First-In, First-Out collection supporting $O(1)$ `enqueue()` and `dequeue()`.
