Balanced Binary Tree

Total Accepted: 48287 Total Submissions: 150312 My Submissions

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.

Show Tags

Have you met this question in a real interview?

Yes

Discuss

Runtime Error Message:	{[{ runtimeError }]}
Last executed input:	{[{ lastExecutedTestCase }]}

Input:	{[{ resultWaTestCaseInput }]}
Output:	{[{ resultWaTestCaseOutput }]}
Expected:	{[{ resultWaTestCaseExpected }]}

Balanced Binary Tree

Submission Result: {[{ statusText }]}More Details

Share your acceptance!