def test_left_right(): bst = BinarySearchTree() bst.add(2) bst.add(4) bst.add(6) expected = [2, 4, 6] actual = bst.pre_order() assert actual == expected
def test_return_preorder_traversal(): tree = BinarySearchTree() traverse = BinaryTree() tree.add(3) tree.add(2) tree.add(6) actual = tree.pre_order() expected = [3,2,6] assert actual == expected
def test_pre_order(): tree = BinarySearchTree() tree.add(10) tree.add(5) tree.add(15) expected = [10, 5, 15] actual = tree.pre_order() assert expected == actual
def test_pre_order(): tree_stuff = BinarySearchTree() tree_stuff.add(5) tree_stuff.add(6) tree_stuff.add(7) tree_stuff.add(8) actual = tree_stuff.pre_order() expected = [5, 6, 7, 8] assert actual == expected
def test_pre_order(): """ Can successfully return a collection from a preorder traversal """ tree = BinarySearchTree() tree.add(6) tree.add(5) tree.add(7) tree.add(8) tree.add(3) tree.add(4) assert tree.pre_order(tree.root) == [6, 5, 3, 4, 7, 8]
def test_pre_order(): tree = BinarySearchTree() tree.add(6) tree.add(8) tree.add(7) tree.add(4) tree.add(9) tree.add(3) expected = [6, 4, 3, 8, 7, 9] actual = tree.pre_order() assert expected == actual
def test_preorder(): bst = BinarySearchTree() bst.add(4) bst.add(7) bst.add(5) bst.add(9) bst.add(2) bst.add(30) bst.add(-1) expected = [4, 2, -1, 7, 5, 9, 30] actual = bst.pre_order() assert actual == expected
def test_pre_order_one(): new_tree = BinarySearchTree() new_tree.add(10) expected = [10] assert new_tree.pre_order(new_tree.root) == expected
def test_pre_order_empty(): tree = BinarySearchTree() expected = [] actual = tree.pre_order() assert actual == expected
def test_single_node_empty_tree(): bst = BinarySearchTree() bst.add(4) expected = [4] actual = bst.pre_order() assert actual == expected
def test_pre_order_one(): tree_one = BinarySearchTree() tree_one.add(20) assert tree_one.pre_order() == [20]