剑指offer平衡二叉树

题目描述

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

思路

     左右子树的长度差不大于1为平衡二叉树，可以借助二叉树深度一题。二叉树深度一题是从下往上算长度，而这道题是利用二叉树深度一题，从上到下判别各个子树是否为平衡二叉树

1. 统计左子树的深度
2. 再统计右子树的深度
3. 如果之差大于1，返回False
4. 否则，递归继续判别左子树的左右子树，和右子树的左右子树
5. 遇到没有结点时，返回True

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:  
    def IsBalanced_Solution(self, pRoot):
        # write code here
        if not pRoot:
            return True
        ldepth=self.depth(pRoot.left)
        rdepth=self.depth(pRoot.right)
        if abs(ldepth-rdepth)>1:
            return False
        return self.IsBalanced_Solution(pRoot.left) and self.IsBalanced_Solution(pRoot.right)
    def depth(self,pRoot):
        if not pRoot:
            return 0
        ldepth=self.depth(pRoot.left)
        rdepth=self.depth(pRoot.right)
        return max(ldepth,rdepth)+1

测试用例

if __name__=='__main__':
    s=Solution()
    # 用的是求二叉树深度一题的树
    root = TreeNode(1)
    node1 = TreeNode(2)
    node2 = TreeNode(3)
    node3 = TreeNode(4)
    node4 = TreeNode(5)
    node5 = TreeNode(6)
    node6 = TreeNode(7)
    root.left = node1
    root.right = node2
    node1.left = node3
    node1.right = node4
    node2.right = node5
    node4.left = node6
    node3.left = node3.right = node6.left = node6.right = node4.right = node2.left = node5.left = node5.right = None
    # 调用函数
    print(s.IsBalanced_Solution(root))