/// <summary>
/// Node that holds an int.
/// </summary>
/// <param name="value"></param>
public NodeString(BinaryTreeString tree, string value)
{
//Set the nodes tree.
this.tree = tree;
//Set the nodes value.
this.value = value;
}
//Dose that thing.
static public void StringSearch()
{
//Welcome the user.
Console.WriteLine("Welcome to the String Binary Search Tree.");
Console.WriteLine();
//Create the Binary Tree.
BinaryTreeString tree = new BinaryTreeString();
//Create a Random number.
Random rand = new Random();
//Print to the console.
Console.WriteLine("Here is 10 names:");
//List of names
List <string> names = new List <string>();
names.Add("Nathan");
names.Add("Jacob");
names.Add("Rosie");
names.Add("Tammy");
names.Add("Tom");
names.Add("Judy");
names.Add("Milly");
names.Add("Craig");
names.Add("Matt");
names.Add("Lucy");
names.Add("Zack");
names.Add("Casey");
names.Add("David");
//Get 10 random numbers.
for (int i = 0; i < names.Count; i++)
{
//Add the number to the Binary Tree.
tree.AddValue(names[i]);
//Print the number to the console.
Console.Write(names[i]);
//Insert the commas.
if (i < (names.Count - 1))
{
Console.Write(",");
}
}
//Output to the console.
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Here they are sorted:");
//Traverse the tree.
tree.Traverse();
tree.Print();
Console.Write("\b \b");
//Output to the console.
Console.WriteLine();
Console.WriteLine();
Console.Write("Enter number to search for: ");
//Get the input to search.
string input = Console.ReadLine();
//Search the Binary Tree.
NodeString search = tree.Search(input);
//New Line.
Console.WriteLine();
//If the returned node isnt null.
if (search != null)
{
//We found it.
Console.WriteLine("Found: " + search.value + " :) \n");
}
else
{
//Not found.
Console.WriteLine("Not Found :( \n");
}
//Print to the console.
Console.Write("Press enter to restart...");
//Pause.
Console.ReadLine();
//Clear the console.
Console.Clear();
//Restart the Console App.
StringSearch();
}
