## Question

Given a binary tree, write a function to determine whether the tree is balanced.

eg.

Balanced tree (all branches are same height +- 1):

Balanced tree (all subtrees are balanced):

Once you think that you’ve solved the problem, click below to see the solution.

*As always, remember that practicing coding interview questions is as much about how you practice as the question itself. Make sure that you give the question a solid go before skipping to the solution. Ideally if you have time, write out the solution first by hand and then only type it into your computer to verify your work once you’ve verified it manually. To learn more about how to practice, check out this blog post.*

## Solution

How was that problem? You can check out the solution in the video below.

Here is the source code for the solution shown in the video:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
private class Node { private int value; private Node right; private Node left; } public boolean isBalanced(Node n) { if (balancedHeight(n) > -1) return true; return false; } public int balancedHeight(Node n) { if (n == null) return 0; int h1 = balancedHeight(n.right); int h2 = balancedHeight(n.left); if (h1 == -1 || h2 == -1) return -1; if (Math.abs(h1 - h2) > 1) return -1; if (h1 > h2) return h1 + 1; return h2 + 1; } |

Did you get the right answer to this coding interview question? Please share your thoughts in the comments below.