A balanced binary search tree where the height of the two subtrees (children) of a node differs by at most one. Look-up, insertion, and deletion are O( log n), where n is the number of nodes in the tree.
One page links to AVLTree:
lib/main.php:944: Notice: PageInfo: Cannot find action page