测试图片code
? 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_ ? 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() ? (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |