Balanced Trees
- AVL
  * Pretty much
- Red-Black
  * Pretty good
- B-Tree & B+-Tree
  * Always

- Insertion, deletion, search are the same as for BST. So are traversals.

Red-Black
- Trees are updated via recloring and rotation.
- Insertion: 
  * If parent is black, trivial.
  * If parent is red:
    > If its sibling is red, can probably recolor
    > If its sibling is black, rotation is in the offing.
      + After rotation, some recoloring may be required.
    
  * For the no aunt problem, rotate around the grandparent. Recoloring should be considered