|
Related articles:
B-tree
Splay tree
Binary search tree
List of data structures
Red-black tree
Self-balancing binary search tree
Key terms: tree avl node balance log subtree left case root then rotation right height needed child avl tree lookup must insertion operations deletion unbalanced if the balance factor either right subtree retracing checked left subtree left rotation computer performed each node necessary traversed tree rotation p as the root right rotation data structure binary search tree rebalancing rotation is needed if the balance factor becomes Search external links cited by footnotes on Wikipedia page AVL tree: |
|