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
151,083
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 My Free Month

Start your free month on LinkedIn Learning, which now features 100% of Lynda.com courses. Develop in-demand skills with access to thousands of expert-led courses on business, tech and creative topics.

Start My Free Month

You are now leaving Lynda.com and will be automatically redirected to LinkedIn Learning to start your free trial.