Avl Tree Sign Video
No video uploaded yet.
Definition
An AVL tree is a self-balancing binary search tree, and it is the first such data structure to be invented.[1] In an AVL tree, the heights of the two child subtrees of any node differ by at most one; therefore, it is also said to be height-balanced. 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.
Source: Wikipedia
Other Submissions
BROWSE
All
> Technology
> Computer Science
> Data Structures
> Trees
> Avl Tree
* video needed
click here to zoom in