1. AVL treeIn computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
Read “AVL tree” on English Wikipedia
Read “AVL木” on Japanese Wikipedia
Read “AVL tree” on DBpedia
Read “AVL tree” on English Wikipedia
Read “AVL木” on Japanese Wikipedia
Read “AVL tree” on DBpedia
Discussions
Log in to talk about this word.