Balanced Binary Tree

This solution need some house keeping, I think there are tons of other better ways to write it. Especially the returning -99999 part, I don’t like it although it works.



 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
public class Solution {
    public boolean isBalanced(TreeNode root) {
        if (root == null) return true;
        int height = recursiveStep(root);
        if (height  1){
            return -99999;
        return Math.max(heightLeft, heightRight) + 1;

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s