Binary Search Tree

---

A binary search tree is similar to a normal binary search but instead of looking at the midpoint of the list, it looks at half of a tree and eliminates the other half on each pass.

Complexity

Like with binary search trees, the complexity is O(log n).