Skip navigation
AVL tree: Four Semesters of Computer Science in 5 Hours
AVL tree: Four Semesters of Computer Science in 5 Hours

AVL trees are a specialized binary search tree. When values are added to an AVL tree, a recursive call will check to see if any rebalancing is necessary. A tree is considered out of balance if the difference in height of any two subtrees is greater that one.

Resume Transcript Auto-Scroll
Skill Level Intermediate
4h 46m
Duration
32,970
Views
Show More Show Less

Continue Assessment

You started this assessment previously and didn't complete it. You can pick up where you left off, or start over.

Start Your Free Trial Now

Start your free trial now, and begin learning software, business and creative skills—anytime, anywhere—with video instruction from recognized industry experts.

Start Your Free Trial Now