Useful for dynamic sets

Operations: Search, Min, Max, Predecessor, Successor, Insert, Delete

**Performance of Some of These Operations**

- , where h = height of tree
- , is best case, where n is number of nodes in tree, this is true in the case of a full binary tree
- is worst case, this is true in the case of a linear chain