Binary Search Trees, Rotations & Balance

The BST invariant, degenerate trees, AVL and red-black balance, and rotations.

0 / 6 solved

Question Tags Difficulty Success

1. Locally Fine Globally Broken

binary-search-treeordering-invariant +1

Medium —

2. Where The First Rotation Fires

avl-treerotation +2

Medium —

3. Remove Then Add Back

binary-search-treedeletion +2

Medium —

4. Why The Plain Column Jumps

avl-treebalance +2

Hard —

5. Thirty Two Bad Orders

binary-search-treedegenerate-tree +2

Hard —

6. Single Or Double Reversed

avl-treerotation +2

Hard —

Learning Resources

CMU 15-122, Binary Search Trees

CMU 15-122, AVL Trees

Open Data Structures, Red-Black Trees

Algorithms, 4th Edition, Balanced Search Trees

Up next

6 of 6 questions here are still unsolved.

Next module Heaps & Priority Queues