One doc tagged with "search-trees"

Understand search-tree queries, rotations, and successor deletion, then use red-black invariants to bound height and compare ordered containers.