AVL tree

English

Etymology

Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.

Noun

AVL tree (plural AVL trees)

  1. (computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.

Anagrams

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.