Strutture Dati

vector

push_back	pop_back	insert	erase	find	find index
O(1)	O(1)	O(N)	O(N)	O(N)	O(1)

queue

push	pop	front
O(1)	O(1)	O(1)

stack

push	pop	top
O(1)	O(1)	O(1)

deque

push_back	pop_back	push_front	pop_front
O(1)	O(1)	O(1)	O(1)

set

insert	remove	find
O(log(N))	O(log(N))	O(log(N))

map

insert	access	remove
O(log(N))	O(log(N))	O(log(N))

unordered_map

insert	access	remove
O(1)	O(1)	O(1)

priority_queue

push	pop	top
O(log(N))	O(log(N))	O(1)