def test_one_interstions():
tree1 = BinarySearchTree()
tree1.add(2)
tree1.root.left = Node(1)
tree1.root.right = Node(3)
tree2 = BinarySearchTree()
tree2.add(2)
tree2.root.left = Node(0)
tree2.root.right = Node(4)
actual = tree1.tree_intersections(tree2)
expect = [2]
assert actual == expect
def test_multiple_intersections():
tree1 = BinarySearchTree()
tree1.add(2)
tree1.root.left = Node(1)
tree1.root.right = Node(3)
tree2 = BinarySearchTree()
tree2.add(2)
tree2.root.left = Node(1)
tree2.root.right = Node(3)
actual = tree1.tree_intersections(tree2)
expect = [1, 2, 3]
assert actual == expect
def test_no_intersections():
tree1 = BinarySearchTree()
tree1.add(1)
tree1.add(2)
tree1.add(3)
tree2 = BinarySearchTree()
tree2.add(4)
tree2.add(5)
tree2.add(6)
actual = tree1.tree_intersections(tree2)
expect = []
assert actual == expect
