What Makes a Tree Balanced?
Learn what makes a tree balanced, and analyze a high-level description of the algorithm that determines if a tree is balanced.
Introduction
A binary tree is height-balanced if, for each node in the tree, the difference between the height of the right-subtree and the left-subtree is at most one.
Look at the illustration below of a height-balanced tree. Notice how the left and right subtrees all appear at the same height.
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.