For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Solution:
Recursion. Check if balanced for each node.
The following solution used reference in C++ (needs to be tested)
No comments:
Post a Comment