def test_adding(): test_tree = BinarySearchTree(Node(1)) test_tree.add(2) test_tree.add(3) test_tree.add(4) test_tree.add(5) actual = test_tree.inOrder() expected = [1, 2, 3, 4, 5] assert actual == expected
def test_order_traversal(): test_tree = BinarySearchTree(Node(2)) test_tree.add(1) test_tree.add(3) actual_pre = test_tree.preOrder() expected_pre = [2, 1, 3] assert actual_pre == expected_pre actual_in = test_tree.inOrder() expected_in = [1, 2, 3] assert actual_in == expected_in actual_post = test_tree.postOrder() expected_post = [1, 3, 2] assert actual_post == expected_post