Leetcode#110. Balanced Binary Tree（判断是否是平衡二叉树）

题目

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as:

a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

    3
   / \
  9  20
    /  \
   15   7
Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

       1
      / \
     2   2
    / \
   3   3
  / \
 4   4
Return false.

题意

给你一个二叉树，如上图定义，判断此二叉树是否是平衡二叉树。

题解

首先你要知道什么是平衡二叉树的定义。
平衡二叉树又被称为AVL树，且具有以下性质：

- 它是一 棵空树
- 或它的左右两个子树的高度差的绝对值不超过1
- 并且左右两个子树都是一棵平衡二叉树

知道了性质很容易写出代码。

C++语言这里写代码片

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int getHeight(TreeNode* root)
    {
        if(root==NULL)
            return 0;
        else
            return max(getHeight(root->left), getHeight(root->right))+1;
    }

    bool isBalanced(TreeNode* root) {
        if(root == NULL)//空树
        {
            return true;
        }
        //左右两个子树的高度差的绝对值不超过1
        int h = abs(getHeight(root->left) - getHeight(root->right));
        if(h > 1)
            return false;
        else //左右两个子树都是一棵平衡二叉树
            return isBalanced(root->left) && isBalanced(root->right);

    }
};

Python语言

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def getHeight(self, root):
        if root == None:
            return 0
        else:
            return max(self.getHeight(root.left),self.getHeight(root.right))+1

    def isBalanced(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if root == None:
            return True
        h = abs(self.getHeight(root.left)-self.getHeight(root.right))
        if h > 1:
            return False
        else:
            return self.isBalanced(root.left) and self.isBalanced(root.right)