def test_return_maximum_value(): binary_tree=BinaryTree() node1 = Node(1) node2 = Node(2) node3 = Node(8) node4 = Node(84) node5 = Node(66) node6 = Node(14) binary_tree.root=node1 node1.left = node2 node1.right = node3 node2.left = node4 node2.right = node5 node3.left = node6 assert binary_tree.max_value()==84
def test_return_a_collection_from_a_postorder_traversal(): binary_tree=BinaryTree() node1 = Node('A') node2 = Node('B') node3 = Node('C') node4 = Node('D') node5 = Node('E') node6 = Node('F') binary_tree.root=node1 node1.left = node2 node1.right = node3 node2.left = node4 node2.right = node5 node3.left = node6 post_order = binary_tree.post_order() assert post_order == ['D', 'E', 'B', 'F', 'C', 'A']