What Makes a Tree Balanced?

In this lesson, we are going to discuss what balanced trees are, and how to determine if a tree is balanced or not?


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.

Height(LeftSubTree)Height(RightSubTree)<=1|Height(LeftSubTree) - Height(RightSubTree) |<= 1

Look at the illustration below of a height-balanced tree. Notice how the left and right sub-trees all appear at the same height.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.