平衡二叉树

题目描述

输入一棵二叉树，判断该二叉树是否是平衡二叉树。

 

class Solution {
public:
    int TreeDepth(TreeNode* pRoot)
    {
        if(pRoot == NULL)
            return 0;
        int cnt1 = TreeDepth(pRoot->left);
        int cnt2 = TreeDepth(pRoot->right);
        return cnt1 > cnt2 ? cnt1 +1 : cnt2+1;
    }
     bool IsBalanced_Solution(TreeNode* pRoot) {
         if (pRoot == NULL)
         {
            return 1;
         }
         int cnt1 = TreeDepth(pRoot->left);
         int cnt2 = TreeDepth(pRoot->right);
         if (cnt1 - cnt2 > 1 || cnt1 - cnt2 < -1 || !(IsBalanced_Solution(pRoot->left)) || !(IsBalanced_Solution(pRoot->right)) )
         {
            return 0;
         }
         return 1;
    }
};