AVL tree

名词 n.
中文释义

英文释义

名词 n.
  1. A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.

词形变化

AVL trees plural

词源

Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.
0 次浏览 数据来源: Wiktionary