Binary Search Tree (BST)

Suppose that we have a binary tree that is ordered, such that each node has contents, and all of its left descendants are less than the contents, and all of its right descendants are greater than the contents.