public void SearchForValueThatExistsInRightOfTree()
{
var tree = new BinarySearchTree<int> {15, 18, 17, 20};
Assert.That(tree.Contains(17), Is.EqualTo(true));
}
public void SearchForValueThatDoesNotExist()
{
var tree = new BinarySearchTree<int> {15, 6, 18, 3, 17, 20};
Assert.That(tree.Contains(21), Is.EqualTo(false));
}
public void SearchForValueThatExistsInLeftOfTree()
{
var tree = new BinarySearchTree<int> {15, 6, 3, 7};
Assert.That(tree.Contains(7), Is.EqualTo(true));
}
public void SearchForValueInEmptyTree()
{
var tree = new BinarySearchTree<int>();
Assert.That(tree.Contains(13), Is.EqualTo(false));
}
