首页 > 其他 > 详细

测试图片code

时间:2019-05-21 00:01:25      阅读:154      评论:0      收藏:0      [点我收藏+]

?

def is_full_binary_tree(tree): # This functions returns that is it full binary tree or not?

if tree is None:

return True

def main(): # Main func for testing.

tree = Node(1)

tree.left = Node(2)

tree.right = Node(3)

tree.left.left = Node(4)

tree.left.right = Node(5)

tree.left.right.left = Node(6)

tree.right.left = Node(7)

tree.right.left.left = Node(8)

tree.right.left.left.right = Node(9)

?

print(is_full_binary_tree(tree))

print(depth_of_tree(tree))

print("Tree is: ")

display(tree)

?

if __name__ == ‘__main__‘:

main()

?

?

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_

?

def main(): # Main func for testing.

tree = Node(1)

tree.left = Node(2)

tree.right = Node(3)

tree.left.left = Node(4)

tree.left.right = Node(5)

tree.left.right.left = Node(6)

tree.right.left = Node(7)

tree.right.left.left = Node(8)

tree.right.left.left.right = Node(9)

?

print(is_full_binary_tree(tree))

print(depth_of_tree(tree))

print("Tree is: ")

display(tree)

?

if __name__ == ‘__main__‘:

main()

?

测试图片code

原文:https://www.cnblogs.com/binyang/p/10897340.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!