Some Properties of Binary Search Trees

Height is O(n) (imbalanced) and tex2html_wrap_inline250 (balanced).

Where are largest and smallest elements?

Like the sequence of pivots in quicksort (how do we know we have a partition?).


next up previous
Next: Finding a Key Up: BINARY SEARCH TREES Previous: Binary Search Tree Definition