def tree_intersection(tree1, tree2): list1 = BinarySearchTree.pre_order(tree1) answer_key = [] for i in list1: if tree2.contains(i): answer_key.append(i) return answer_key
def test_pre_order(): tree = BinarySearchTree() tree.add(50) tree.add(25) tree.add(75) tree.add(20) tree.add(80) tree.add(40) """ 50 25 75 20 40 80 """ actual = tree.pre_order() expected = [50, 25, 20, 40, 75, 80] assert actual == expected
def test_preorder(): tree = BinarySearchTree(5) tree.add(3) tree.add(19) assert tree.pre_order() == [5, 3, 19]