| DS | Insert | Delete | Search | 
|---|---|---|---|
| List | O(1) tail | O(n) | O(n) | 
| Set | O(1) | O(1) | O(1) | 
| Stack/Queue | O(1) | O(1) | O(n) | 
| Heap | O(log n) | O(log n) | O(n) | 
| Structure | Enqueue/Push | Dequeue/Pop | Use Case | 
|---|---|---|---|
| Stack | O(1) | O(1) | DFS, Undo | 
| Queue | O(1) | O(1) chan | BFS, Task Queues | 
| Operation | Time Complexity | Space Complexity | 
|---|---|---|
| Append | O(1) amortized | O(1) | 
| RemoveAt | O(n) | O(1) | 
| Get | O(1) | O(1) |