A binary search tree (BST) is a "binary tree where each node has a Comparable key (and an associated value) and satisfies the restriction that the key in any node is larger than the keys in all nodes in that node's left subtree and smaller than the keys in all nodes in that node's right subtree".[1]
References[]
- ↑ Sedgewick, Robert, and Kevin Wayne. "3.2 Binary Search Trees." Algorithms, 4th Edition. Robert Sedgewick and Kevin Wayne, 13 Sept. 2015. Web. 11 Oct. 2015.