Binary Search Trees
Binary search trees (or BSTs) have the characteristic properties
- each node is the root of 0, 1 or 2 subtrees
- all values in any left subtree are less than root
- all values in any right subtree are greater than root
- these properties applies over all nodes in the tree
![[Diagram:Pic/three-bin-search-trees.png]](Pic/three-bin-search-trees.png)
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}