NO CODING NO LIFE: Balanced Binary Tree
Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.
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.
Have you met this question in a real interview?Read full article from NO CODING NO LIFE: Balanced Binary Tree
No comments:
Post a Comment