Overview

AVL tree


'AVL tree' can also refer to...

 

More Like This

Show all results sharing this subject:

  • Computing

GO

Show Summary Details

Quick Reference

A binary search tree such that for each node the heights of the left and right subtrees differ by at most one. Thus the balance of each node is − 1, 0, or + 1. During insertion or deletion, a node in an AVL tree may become critical or unbalanced and then the tree has to be reorganized to maintain its balanced property. The tree is named for its originators, Georgy Maximovitch Adel'son-Vel'skii and Yevgeney Mikhailovitch Landis.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.