- ?
- defis_full_binary_tree(tree): # This functions returns that is it full binary tree or not?
- iftree isNone:
- returnTrue
defmain(): # 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 isNone) and(tree.right isNone):
- returnTrue
- if(tree.left isnotNone) and(tree.right isnotNone):
- return(is_full_binary_tree(tree.left) andis_full_binary_
- ?
- defmain(): # 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()
- ?
来源: http://www.bubuko.com/infodetail-3066410.html