LintCode 93. 平衡二叉树

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */


class Solution {
public:
    /*
     * @param root: The root of binary tree.
     * @return: True if this Binary tree is Balanced, or false.
     */
    bool isBalanced(TreeNode * root) {
        // write your code here
        return subTreeBalanced(root)!=-1;
    }
    int subTreeBalanced(TreeNode* node)
    {
        if(node==NULL)
            return 0;
        int left=subTreeBalanced(node->left);
        int right=subTreeBalanced(node->right);
        if(left==-1||right==-1||abs(left-right)>1)
        {
            return -1;
        }else
        {
            return max(left,right)+1;
        }
    }
};