[Cs3] Time Complexities

[Mikhail Nesterenko]

> 
> Will we have to know time complexities of certain operations and such for
> the midterm?

Yes, you do need to know that, say, lookup and insertion/deletion in
an ordered map has O(Log(N)) complexity.

You do not have to know that the implementation uses a red-black tree
or how the tree achieves this complexity. Same goes for the other
containers and implementation data structure.s

Thanks,
--
Mikhail