Code2

最新推荐文章于 2024-03-19 09:38:42 发布

zzm_

最新推荐文章于 2024-03-19 09:38:42 发布

阅读量532

点赞数

原文链接：http://www.cnblogs.com/binyang/p/10897482.html

版权

def display(tree): #In Order traversal of the tree

    if tree is None:
        return

    if tree.left is not None:

        display(tree.left)

    print(tree.data)

    if tree.right is not None:
        display(tree.right)

    return

def depth_of_tree(tree): #This is the recursive function to find the depth of binary tree.
    if tree is None:
        return 0
    else:
        depth_l_tree = depth_of_tree(tree.left)
        depth_r_tree = depth_of_tree(tree.right)
        if depth_l_tree > depth_r_tree:
            return 1 + depth_l_tree
        else:
            return 1 + depth_r_tree

def is_full_binary_tree(tree): # This functions returns that is it full binary tree or not?
    if tree is None:
        return True
    if (tree.left is None) and (tree.right is None):
        return True
    if (tree.left is not None) and (tree.right is not None):
        return (is_full_binary_tree(tree.left) and is_full_binary_tree(tree.right))
    else:
        return False