AVL tree

短语

词形变化

AVL trees 复数 AVL trees

释义与例句

n.
  1. 1.

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

    计算机 工程 数学

词源

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

来源：wiktionary