Unique Skill ID: KS120TY6VMKTW69X09NF

AVL Tree

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 Full Description
This Skill is part of Lightcast Open Skills, a library of over 32,000 skills used by schools, communities, and businesses that has become the standard language.
Search for other skills

AVL Tree 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

Looking for more data on job postings?