Uses
List, Queue, Stack
Circular List
Real Life objects like Trains
Adjacency List for Graph
Time Complexity
| Operations | Singly Linked | Doubly Linked |
|---|---|---|
| Lookup | O(n) | O(n) |
| Traversal | O(n) | O(n) |
| Insert at Head | O(1) | O(1) |
| Insert at Tail | O(1) | O(1) |
| Remove at Head | O(1) | O(1) |
| Remove at Tail | O(n) | O(1) |
| Remove at Middle | O(n) | O(n) |