def test_post_order_traversal():
tree = BinaryTree(1)
tree.root.left = Node(2)
tree.root.right = Node(3)
tree.root.left.left = Node(4)
tree.root.left.right = Node(5)
tree.root.right.left = Node(6)
tree.root.right.right = Node(7)
assert tree.print_tree("postorder") == '4-5-2-6-7-3-1-'
def test_in_order_traversal():
tree = BinaryTree(1)
tree.root.left = Node(2)
tree.root.right = Node(3)
tree.root.left.left = Node(4)
tree.root.left.right = Node(5)
tree.root.right.left = Node(6)
tree.root.right.right = Node(7)
assert tree.print_tree("inorder") == '4-2-5-1-6-3-7-'
def test_breadth_first_correct_order():
tree = BinaryTree(1)
tree.root.left = Node(2)
tree.root.right = Node(3)
tree.root.left.left = Node(4)
tree.root.left.right = Node(5)
tree.root.right.left = Node(6)
tree.root.right.right = Node(7)
assert tree.print_tree('breadthfirst') == [1, 2, 3, 4, 5, 6, 7]
def test_pre_order_traversal():
tree = BinaryTree(1)
tree.root.left = Node(2)
tree.root.right = Node(3)
tree.root.left.left = Node(4)
tree.root.left.right = Node(5)
tree.root.right.left = Node(6)
tree.root.right.right = Node(7)
assert tree.print_tree("preorder") == '1-2-4-5-3-6-7-'