First page Back Continue Last page Summary Graphic
Restructuring summary
Let
- x be the root of the red tree (C or d)
- y be the parent of x
- z be the grand-parent of x
restructure(x) Perform either
- One rotation (first case)
- A sequence of two rotations to reduce the height
Beware!
- Symmetric cases on the left
- Implementation: update all pointers!