Binary Search Trees

Overview

Binary search trees are not mainly a recommendation to hand-roll pointer trees. They teach an ordered-set mindset: keep ordering separate from representation, treat height as the operational risk, make local navigation decisions from invariants, and use small pointer rewrites to preserve object identity while changing structure.

When applying this chapter in industrial contexts, answer both questions:

1. What invariant makes the operation correct?
2. What data-shape, identity, duplicate, cache, or library constraint makes the textbook implementation inappropriate or appropriate?

Shared CLRS Conventions

Also follow the parent clrs skill for mathematical formatting, theorem preconditions, proof tone, and chapter-skill routing. Put formal bounds in display LaTeX blocks, not inline prose.

When to Use

Use this skill for: