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 Should_Check_Contains_When_Empty_Tree()
{
//arrange
var tree = new MyBinarySearchTree <int>();
//act
var result = tree.Contains(5);
//assert
result.ShouldBeEquivalentTo(false);
}
public void Should_Check_Contains_False()
{
//arrange
var tree = new MyBinarySearchTree <int>();
tree.Insert(8);
tree.Insert(4);
tree.Insert(10);
tree.Insert(2);
tree.Insert(6);
tree.Insert(20);
//act
var result = tree.Contains(5);
//assert
result.ShouldBeEquivalentTo(false);
}
public void RandomNode_Should_Check_Multiple_Length()
{
//arrange
var tree = new MyBinarySearchTree <int>();
tree.Insert(10);
tree.Insert(6);
tree.Insert(15);
tree.Insert(4);
tree.Insert(8);
tree.Insert(13);
tree.Insert(17);
tree.Insert(3);
tree.Insert(5);
tree.Insert(7);
tree.Insert(14);
tree.Insert(2);
//act
var result = _treesGraphs.RandomNode(tree);
//assert
tree.Contains(result.Data).ShouldBeEquivalentTo(true);
}
