def test_pre_order_traversal():
tree = BinaryTree()
tree.root = Node(1)
tree.root.left = Node(4)
tree.root.right = Node(2)
tree.root.left.left = Node(3)
tree.root.left.right = Node(5)
actual = tree.pre_order()
expected = [1, 4, 3, 5, 2]
assert actual == expected
def test_preorder_traversal():
tree = BinaryTree()
node1 = Node(1)
node2 = Node(3)
node3 = Node(5)
node1.left = node2
node1.right = node3
tree.root = node1
actual = tree.pre_order()
expected = [1, 3, 5]
assert actual == expected
def test_pre_order():
grok = BinaryTree()
groot = Node('Groot')
i = Node('I')
am = Node('Am')
starlord = Node('Future Antman')
rocket = Node('Trash Panda')
grok.root = i
grok.root.left = am
grok.root.right = starlord
grok.root.left.left = groot
grok.root.left.right = rocket
assert grok.pre_order() == [
'I', 'Am', 'Groot', 'Trash Panda', 'Future Antman'
]