LintCode:平衡二叉树

最新推荐文章于 2019-11-22 19:25:08 发布

zyaphone

最新推荐文章于 2019-11-22 19:25:08 发布

阅读量677

点赞数

分类专栏： lintcode python

本文链接：https://blog.csdn.net/u012225151/article/details/51255098

版权

lintcode 同时被 2 个专栏收录

139 篇文章 0 订阅

订阅专栏

python

116 篇文章 0 订阅

订阅专栏

LintCode:平衡二叉树

先对树的每个节点求高度，最后判断。

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""
class Solution:
    """
    @param root: The root of binary tree.
    @return: True if this Binary tree is Balanced, or false.
    """
    def isBalanced(self, root):
        # write your code here
        if root == None:
            return True
        L = []
        self.pre_order(root, L)
        for i in L:
            if i > 1:
                return False
        return True
    #求每个节点的高度    
    def tree_depth(self, root):  
        if root == None:
            return 0

        l_depth = self.tree_depth(root.left)
        r_depth = self.tree_depth(root.right)

        return  (l_depth + 1) if (l_depth > r_depth)  else (r_depth + 1)

    def pre_order(self, root, L):
        if root == None:
            return
        l_d = self.tree_depth(root.left)
        r_d = self.tree_depth(root.right)
        L.append(abs(l_d - r_d))
        self.pre_order(root.left, L)
        self.pre_order(root.right, L)