Skip to main content

Balanced Tree

Learn Balanced Tree (Trees, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

What Does "Balanced" Mean? A tree is HEIGHT-BALANCED if, for every node, the heights of its left and right subtrees differ by at most 1. Balance is what keeps a BST's operations at O(log n) - an unbalanced BST can degrade to a linked list with O(n) operations.

More lessons in Trees