Home
Main website
Display Sidebar
Hide Ads
Recent Changes
View Source:
AVLTree
Edit
PageHistory
Diff
Info
LikePages
You are viewing an old revision of this page.
View the current version
.
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
:
BinaryTree