public void FalseIfValueNotInSearchTree()
{
Node <int> node1 = new Node <int>(10);
Node <int> node2 = new Node <int>(20);
Node <int> node3 = new Node <int>(30);
Node <int> node4 = new Node <int>(40);
Node <int> node5 = new Node <int>(50);
Node <int> node6 = new Node <int>(9);
Node <int> node7 = new Node <int>(8);
Node <int> node8 = new Node <int>(7);
Node <int> node9 = new Node <int>(6);
MyBinarySearchTree tree = new MyBinarySearchTree();
tree.Add(node1);
tree.Add(node2);
tree.Add(node3);
tree.Add(node4);
tree.Add(node5);
tree.Add(node6);
tree.Add(node7);
tree.Add(node8);
tree.Add(node9);
Assert.False(tree.Contains(node1, 47));
}
public void WillReturnNullIfOneTreeEmpty()
{
MyBinarySearchTree treeOne = new MyBinarySearchTree();
MyBinarySearchTree treeTwo = new MyBinarySearchTree();
Node <int> nodeOne1 = new Node <int>(10);
Node <int> nodeOne2 = new Node <int>(20);
Node <int> nodeOne3 = new Node <int>(30);
Node <int> nodeOne4 = new Node <int>(45);
Node <int> nodeOne5 = new Node <int>(50);
Node <int> nodeOne6 = new Node <int>(5);
Node <int> nodeOne7 = new Node <int>(8);
Node <int> nodeOne8 = new Node <int>(7);
Node <int> nodeOne9 = new Node <int>(6);
treeOne.Add(nodeOne1);
treeOne.Add(nodeOne2);
treeOne.Add(nodeOne3);
treeOne.Add(nodeOne4);
treeOne.Add(nodeOne5);
treeOne.Add(nodeOne6);
treeOne.Add(nodeOne7);
treeOne.Add(nodeOne8);
treeOne.Add(nodeOne9);
Assert.Null(TreeIntersection.Program.TreeIntersection(treeOne, treeTwo));
}
public void WillReturnListOfSharedValues()
{
MyBinarySearchTree treeOne = new MyBinarySearchTree();
MyBinarySearchTree treeTwo = new MyBinarySearchTree();
Node <int> nodeOne1 = new Node <int>(10);
Node <int> nodeOne2 = new Node <int>(20);
Node <int> nodeOne3 = new Node <int>(30);
Node <int> nodeOne4 = new Node <int>(45);
Node <int> nodeOne5 = new Node <int>(50);
Node <int> nodeOne6 = new Node <int>(5);
Node <int> nodeOne7 = new Node <int>(8);
Node <int> nodeOne8 = new Node <int>(7);
Node <int> nodeOne9 = new Node <int>(6);
Node <int> nodeTwo1 = new Node <int>(10);
Node <int> nodeTwo2 = new Node <int>(18);
Node <int> nodeTwo3 = new Node <int>(30);
Node <int> nodeTwo4 = new Node <int>(40);
Node <int> nodeTwo5 = new Node <int>(50);
Node <int> nodeTwo6 = new Node <int>(9);
Node <int> nodeTwo7 = new Node <int>(8);
Node <int> nodeTwo8 = new Node <int>(7);
Node <int> nodeTwo9 = new Node <int>(1);
treeOne.Add(nodeOne1);
treeOne.Add(nodeOne2);
treeOne.Add(nodeOne3);
treeOne.Add(nodeOne4);
treeOne.Add(nodeOne5);
treeOne.Add(nodeOne6);
treeOne.Add(nodeOne7);
treeOne.Add(nodeOne8);
treeOne.Add(nodeOne9);
treeTwo.Add(nodeTwo1);
treeTwo.Add(nodeTwo2);
treeTwo.Add(nodeTwo3);
treeTwo.Add(nodeTwo4);
treeTwo.Add(nodeTwo5);
treeTwo.Add(nodeTwo6);
treeTwo.Add(nodeTwo7);
treeTwo.Add(nodeTwo8);
treeTwo.Add(nodeTwo9);
int[] expectedArr = new int[] { 10, 8, 30, 7, 50 };
List <int> resultList = TreeIntersection.Program.TreeIntersection(treeOne, treeTwo);
int[] resultArr = resultList.ToArray();
Assert.Equal(expectedArr, resultArr);
}
public void WillReturnNullIfNoSharedValues()
{
MyBinarySearchTree treeOne = new MyBinarySearchTree();
MyBinarySearchTree treeTwo = new MyBinarySearchTree();
Node <int> nodeOne1 = new Node <int>(10);
Node <int> nodeOne2 = new Node <int>(20);
Node <int> nodeOne3 = new Node <int>(30);
Node <int> nodeOne4 = new Node <int>(45);
Node <int> nodeOne5 = new Node <int>(50);
Node <int> nodeOne6 = new Node <int>(5);
Node <int> nodeOne7 = new Node <int>(8);
Node <int> nodeOne8 = new Node <int>(7);
Node <int> nodeOne9 = new Node <int>(6);
Node <int> nodeTwo1 = new Node <int>(1000);
Node <int> nodeTwo2 = new Node <int>(1800);
Node <int> nodeTwo3 = new Node <int>(3000);
Node <int> nodeTwo4 = new Node <int>(4000);
Node <int> nodeTwo5 = new Node <int>(5000);
Node <int> nodeTwo6 = new Node <int>(900);
Node <int> nodeTwo7 = new Node <int>(800);
Node <int> nodeTwo8 = new Node <int>(700);
Node <int> nodeTwo9 = new Node <int>(100);
treeOne.Add(nodeOne1);
treeOne.Add(nodeOne2);
treeOne.Add(nodeOne3);
treeOne.Add(nodeOne4);
treeOne.Add(nodeOne5);
treeOne.Add(nodeOne6);
treeOne.Add(nodeOne7);
treeOne.Add(nodeOne8);
treeOne.Add(nodeOne9);
treeTwo.Add(nodeTwo1);
treeTwo.Add(nodeTwo2);
treeTwo.Add(nodeTwo3);
treeTwo.Add(nodeTwo4);
treeTwo.Add(nodeTwo5);
treeTwo.Add(nodeTwo6);
treeTwo.Add(nodeTwo7);
treeTwo.Add(nodeTwo8);
treeTwo.Add(nodeTwo9);
Assert.Null(TreeIntersection.Program.TreeIntersection(treeOne, treeTwo));
}
