LintCode93:平衡二叉树的判定

题目描述

给定一个二叉树,确定它是高度平衡的。对于这个问题,一棵高度平衡的二叉树的定义是：一棵二叉树中每个节点的两个子树的深度相差不会超过1。

---

样例

给出二叉树 A={3,9,20,#,#,15,7}, B={3,#,20,15,7}

A)  3            B)    3 
   / \                  \
  9  20                 20
    /  \                / \
   15   7              15  7

那么二叉树A是高度平衡的二叉树，但是B不是。

---

解题思路

通过后序遍历，自底向上的比较左右子树的高度差，看是否大于1。

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 balanced(TreeNode *root, int &depth) {
        if (root == NULL) return true;
        int dLeft = 0, dRight = 0;
        bool bLeft = balanced(root->left, dLeft);
        bool bRight = balanced(root->right, dRight);
        if (bLeft && bRight) {
            int diff = dLeft - dRight;
            if (diff <= 1 && diff >= -1) {
                depth = max(dLeft, dRight) + 1;
                return true;
            }
        }
        return false;
    }
    bool isBalanced(TreeNode * root) {
        // write your code here
        int dep = 0;
        return balanced(root, dep);

    }
};