AVL tree（各ノードで左右の部分木の高さの差）とは - 英語 - 多言語

ログインすると広告が減り、学習に集中できます。

意味・例文の表示言語

検索内容:

AVL tree

(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.

To guarantee logarithmic search time, we implemented an AVL tree that rebalances itself after every insertion and deletion.

活用形複数形

plural of AVL tree

原形: AVL tree

AVL trees maintain balance by performing rotations during insertions and deletions to guarantee logarithmic height.

Webで検索する