Tip: Click Insert a random item repeatedly to quickly build a binary search tree.

A binary search tree is a binary tree where each node has a comparable key and satisfies the restriction that the key in any node is larger than the keys in all nodes in that node's left sub-tree and smaller than the keys in all nodes in that node's right sub-tree.