public bool SearchBinary(int data)
{
NodeClass currentValue = start;
bool continueSearch = true;
bool foundNum = false;
while (continueSearch)
{
if (data == currentValue.value) // If it matches the parent
{
start = currentValue;
Console.WriteLine(data + " Found!");
Console.ReadLine();
foundNum = true;
continueSearch = false;
}
else if (data < currentValue.value)
{
//Go to left
currentValue = currentValue.leftNode;
if (currentValue == null)
{
continueSearch = false;
Console.WriteLine(data + " not found!");
Console.ReadLine();
}
}
else if (data > currentValue.value)
{
// Go to right
// Once data goes below search amount, currentValue returns null
currentValue = currentValue.rightNode;
if (currentValue == null)
{
continueSearch = false;
Console.WriteLine(data + " not found!");
Console.ReadLine();
}
}
else//Figure out how to get an else statement working
{
continueSearch = false;
}
}
return(foundNum);
}
public void AddNode(int data) // Take whatever value is given to us
{
NodeClass node = new NodeClass(data); // Instantiate NodeClass to use member values
if (start == null)
{
start = node; // Pulls only field, which is value
return;
}
else
{
NodeClass currentValue = start;
while (true)
{
//parent = currentValue; //Parent starts null
if (data <= currentValue.value)
{
if (currentValue.leftNode == null)
{
currentValue.leftNode = node;
return;
}
else
{
currentValue = currentValue.leftNode;
}
}
else if (data >= node.value)
{
if (currentValue.rightNode == null)
{
currentValue.rightNode = node;
return;
}
else
{
currentValue = currentValue.rightNode;
}
}
}
}
}
// Constructor
public BinarySearchTreeClass()
{
start = null; // Begin starting value at null
}