next up previous
Next: Binary Search Tree Property Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

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 , where n is number of nodes in tree, this is true in the case of a full binary tree
$\Theta(n)$ is , this is true in the case of a linear chain



Copyright © 1998 The University of Texas at Arlington