Binary Search Tree

A binary search tree is a tree like structure where:

• Each node can have up to two children
• Children nodes have a sense of “direction” - Left or Right
• The key of the Left node is less than the key of the Right node

---

Operations:

The binary search tree has a number of operations which it implements:

• insert
• delete
• search

Each operation is guaranteed to run in $O(\log n)$ time.