|
Binary search trees are binary trees with an ordering requirement: if node v contains integer k, then all nodes in the left subtree of v have values that are less than k and all nodes in the right subtree of v have values that are greater than k.
Lookup and insertion take advantage of and preserve the ordering requirement. Deletion, covered in the next page, is more involved, but it also follows the ordering requirement.
|