Linked List #
Singly Linked List #
| Operation | Time Complexity | Note |
|---|---|---|
| Access | O(n) | No random access |
| Search | O(n) | |
| Insertion | O(1) | Assuming you already have a reference to the node at the desired position |
| Deletion | O(1) | Assuming you already have a reference to the node at the desired position |
Doubly Linked List #
| Operation | Time Complexity | Note |
|---|---|---|
| Access | O(n) | No random access |
| Search | O(n) | |
| Insertion | O(1) | Assuming you already have a reference to the node at the desired position |
| Deletion | O(1) | Assuming you already have a reference to the node at the desired position |
Queues #
| Operation | Time Complexity |
|---|---|
| Enqueue | O(1) |
| Dequeue | O(1) |