AVL Tree

KS120TY6VMKTW69X09NF

In computer science, an AVL tree is a self-balancing binary search tree. 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; if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where 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 more on Wikipedia

Have feedback on this skill? Let us know.

pattern

Job Postings Data

Top Companies Posting

Job Postings Analytics Loading Spinner

Top Job Titles

Job Postings Analytics Loading Spinner

Job Postings Trend

Job Postings Analytics Loading Spinner

Live Job Postings

Job Postings Analytics Loading Spinner