Binary search trees
↑A BST orders keys so smaller values lie to the left and larger values to the right under a chosen duplicate policy. Its height, not just its node count, determines basic operation costs.
How to study this section
Section titled “How to study this section”Start with one concept, work through a small example, and verify your prediction. Follow linked topics when a prerequisite or related idea needs more explanation.
Explore guides and subcategories
Section titled “Explore guides and subcategories”Articles