// height(’12’) = max(height(‘8′), height(’18’)) + 1 = 1 + 1 = 2 The idea is, if we take a closer look at the depth first traversal, we can notice that ...
Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differs by more than 1.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback