O(N)
vector: erase
O(N)
vector: push_front
Amortized: O(1)
vector: push_back
O(N)
vector: pop_front
O(1)
vector: pop_back
O(1)
vector: search
O(N)
sorted vector: push
O(N)
sorted vector: erase
O(log(N))
sorted vector: search
Amortized: O(1)
deque: push_front
Amortized: O(1)
deque: push_back
O(1)
deque: pop_front
O(1)
deque: pop_back
O(1)
stack
O(1)
queue: push
O(1) if circularized, otherwise O(N)
queue: pop
O(1)
queue: top / front
Worst case: O(N), Average case: O(log(N))
BST
O(log(N))
AVL Tree
O(log(N))
heap: push
O(1)
heap: pop
O(1)
heap: top/front
Average: O(1)
Hash Table
O(N)
DLL: erase
O(N)
DLL: search
O(1)
DLL: push
O(1)
DLL: pop
