[Cs3] Red and Black trees

[Mikhail Nesterenko]

You need to know it is a self-balancing binary search tree that has
logarithmic lookup/insertion and deletion, and the depth of one leaf
is no more than twice the depth of another.

Thanks,
--
Mikhail

> Hi, my friends and I are studying and trying to balance the red and black trees. We are having a problem grasping the method to balance this tree. We wanted to know how in-depth the red and black tree questions would be on the midterm. It seems more oriented towards the algorithms course we have yet to take. This balancing system is probably automatic for our studied map and set containers.