测试代码表现

1 def depth_of_tree(tree): #This is the recursive function to find the depth of binary tree.  2     if tree is None:  3         return 0  4     else:  5         depth_l_tree = depth_of_tree(tree.left)  6         depth_r_tree = depth_of_tree(tree.right)  7         if depth_l_tree > depth_r_tree:  8             return 1 + depth_l_tree  9         else: 10             return 1 + depth_r_tree 11  12  13 def is_full_binary_tree(tree): # This functions returns that is it full binary tree or not? 14     if tree is None: 15         return True 16     if (tree.left is None) and (tree.right is None): 17         return True 18     if (tree.left is not None) and (tree.right is not None): 19         return (is_full_binary_tree(tree.left) and is_full_binary_tree(tree.right)) 20     else: 21         return False

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_treedef 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