[Cs3] Red & Black Trees

[Mikhail Nesterenko]

> 
> Do we have to know about red and black trees for the quiz on Tuesday?
> 

red-black trees are studied in a different course so they are not the
focus of this course. Here, it is sufficient to know that they:

- are often used for implementation of associative containers,
- have log(n) insertion, deletion and lookup times
- have less overhead than most other balanced threes as
  re-balancing is delayed due to red/black properties.

That is, slide 10 in the associate containers lecture.

thanks,
-- 
Mikhail