public void TestBinaryTree_Contains()
{
// Arrange
var binaryTree = new BinaryTree <int> {
8, 5, 12, 3, 7, 10, 15
};
// Act
var exists = binaryTree.Contains(10);
var doesntExist = binaryTree.Contains(20);
// Assert
Assert.IsTrue(exists);
Assert.IsFalse(doesntExist);
}
public void DontFindObject()
{
BinaryTree <Person> objTree = new BinaryTree <Person>();
Person person1 = new Person("Jason", 40, "Black");
Person person2 = new Person("Michelle", 39, "Blond");
Person person3 = new Person("Lucas", 12, "Brown");
Person person4 = new Person("Carter", 10, "Black");
Person person5 = new Person("Brook", 7, "Blond");
Person person6 = new Person("Pat", 80, "Purple");
Person person7 = new Person("Frank", 39, "Blond");
Person person8 = new Person("Jonathan", 21, "Brown");
Person person9 = new Person("Bob", 10, "Black");
Person person10 = new Person("Darcy", 70, "Blond");
Person person11 = new Person("Mike", 100, "Grey");
Person[] people = new Person[] { person1, person2, person3, person4, person5, person6, person7, person8, person9, person10 };
Person lookFor = person11;
for (int i = 0; i < people.Length; i++)
{
objTree.Add(people[i]);
}
Assert.IsFalse(objTree.Contains(lookFor));
}
public void Check_contains_element(bool isSuccess, int element)
{
// Arrange
// Act
var exists = _sut.Contains(element);
// Assert
Assert.Equal(isSuccess, exists);
}
public void DontFindString()
{
BinaryTree <string> stringTree = new BinaryTree <string>();
string[] names = new string[] { "Jason", "Bob", "Michelle", "Lucas", "Frank", "Mike", "Jose", "Patricia" };
string lookFor = "Adam";
for (int i = 0; i < names.Length; i++)
{
stringTree.Add(names[i]);
}
Assert.IsFalse(stringTree.Contains(lookFor));
}
public void DontFindInt()
{
BinaryTree <int> intTree = new BinaryTree <int>();
int[] item = { 54, 175, 49, 25, -12, 85, -123, 68, 490, 3000, -1290, 0, 65 };
int lookFor = 44;
for (int i = 0; i < item.Length; i++)
{
intTree.Add(item[i]);
}
Assert.IsFalse(intTree.Contains(lookFor));
}
