public static void SearchTreeMenu(SearchTree tree)
{
bool isOn = true;
while (isOn)
{
string userInput = DisplayPrompt();
switch (userInput)
{
case "add":
DisplayAdd();
int numberToAdd = Convert.ToInt32(Console.ReadLine());
Add(numberToAdd, tree);
break;
case "search":
DisplaySearch();
int numberToSearch = Convert.ToInt32(Console.ReadLine());
Search(numberToSearch, tree);
break;
case "exit":
isOn = false;
break;
default:
SearchTreeMenu(tree);
break;
}
}
}
static void Main(string[] args)
{
Node node = new Node();
SearchTree searchTree = new SearchTree();
searchTree.Add(15);
searchTree.Add(12);
searchTree.Add(50);
searchTree.Add(61);
searchTree.Add(33);
searchTree.Add(67);
searchTree.Add(11);
searchTree.Add(34);
}
static void Main(string[] args)
{
SearchTree searchtree = new SearchTree();
searchtree.AddNewNode(50);
searchtree.AddNewNode(10);
searchtree.AddNewNode(80);
searchtree.AddNewNode(11);
searchtree.AddNewNode(55);
searchtree.AddNewNode(56);
Console.ReadLine();
}
public static void Search(int numToSearch, SearchTree tree)
{
bool numFound = tree.Search(numToSearch);
if (numFound)
{
Console.Clear();
Console.WriteLine(" {0} was found!", numToSearch);
Console.ReadLine();
}
else
{
Console.Clear();
Console.WriteLine(" {0} was not found :(", numToSearch);
Console.ReadLine();
}
}
static void Main(string[] args)
{
SearchTree binary = new SearchTree();
binary.Add(50);
binary.Add(63);
binary.Add(47);
binary.Add(52);
binary.Add(49);
binary.Add(71);
binary.Add(12);
binary.Add(11);
binary.Add(32);
binary.Add(94);
binary.Add(39);
SearchTreeMenu(binary);
}
static void Main(string[] args)
{
SearchTree testTree = new SearchTree();
testTree.Add(testTree.Root, 5);
testTree.Add(testTree.Root, 6);
testTree.Add(testTree.Root, 4);
testTree.Add(testTree.Root, 1);
Console.WriteLine();
testTree.InOrder(testTree.Root);
Console.WriteLine();
testTree.PostOrder(testTree.Root);
Console.WriteLine();
testTree.PreOrder(testTree.Root);
Console.WriteLine();
testTree.Breadth(testTree.Root);
Console.Read();
}
static void Main(string[] args)
{
SearchTree tree = new SearchTree();
tree.Add(100);
tree.Add(115);
tree.Add(50);
tree.Add(25);
tree.Add(27);
tree.Add(150);
tree.Add(28);
tree.Add(160);
tree.Add(110);
tree.Add(109);
tree.Add(26);
tree.Search(109);
tree.Search(26);
tree.Search(5);
Console.ReadKey();
}
static void Main(string[] args)
{
SearchTree <int> tree = new SearchTree <int>();
tree.Add(5);
tree.Add(3);
tree.Add(6);
tree.Add(1);
tree.Add(25);
tree.Add(12);
tree.Add(5);
tree.Display();
tree.Search(5);
tree.Search(12);
tree.Search(25);
tree.Search(1);
tree.Search(8);
Console.WriteLine("Press any key to exit.");
Console.ReadKey();
}
public static void Add(int numToAdd, SearchTree tree)
{
tree.Add(numToAdd);
}
