Binary Search Trees

Useful for dynamic sets

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

Performance of Some of These Operations

$\Theta(h)$, where h = height of tree

$\Theta(lg n)$, is best case, where n is number of nodes in tree, this is true in the case of a full binary tree

$\Theta(n)$ is worst case, this is true in the case of a linear chain