public static void Main(string[] args)
{
binarytree myTree = new binarytree();
myTree.set('c', 'C');
myTree.set('h', 'H');
myTree.set('a', 'A');
myTree.set('e', 'E');
myTree.set('f', 'F');
myTree.set('d', 'D');
myTree.set('b', 'B');
myTree.set('j', 'J');
myTree.set('g', 'G');
myTree.set('i', 'I');
myTree.set('k', 'K');
Console.WriteLine("Initial Tree:");
myTree.debug_print();
Console.WriteLine();
Console.WriteLine("Lookups:");
Console.WriteLine(myTree.get('f'));
Console.WriteLine(myTree.get('b'));
Console.WriteLine(myTree.get('i'));
Console.WriteLine();
Console.WriteLine("BFS:");
myTree.walk_bfs();
Console.WriteLine();
Console.WriteLine("DFS preorder:");
myTree.walk_dfs_preorder();
Console.WriteLine();
Console.WriteLine("DFS inorder");
myTree.walk_dfs_inorder();
Console.WriteLine();
Console.WriteLine("DFS postorder");
myTree.walk_dfs_postorder();
Console.WriteLine();
Console.WriteLine("Remove b:");
myTree.remove('b');
myTree.debug_print();
Console.WriteLine();
Console.WriteLine("Remove f:");
myTree.remove('f');
myTree.debug_print();
Console.WriteLine();
Console.WriteLine("Remove h:");
myTree.remove('h');
myTree.debug_print();
}
static void Main(string[] args)
{
string answer;
binarytree newtree = new binarytree();
Random random = new Random();
do
{
Console.WriteLine("1. insert");
Console.WriteLine("2. search");
Console.WriteLine("3. print");
Console.WriteLine("4. make tree random");
Console.WriteLine("5. remove");
Console.WriteLine("6. print preorder");
Console.WriteLine("7. print postorder");
Console.WriteLine("8. print inorder");
Console.WriteLine("type 'quit' to quit");
answer = Console.ReadLine();
if (answer == "4")
{
for (int i = 0; i < 8; i++)
{
int randomNumber = random.Next(65, 91);
newtree.insert((char)randomNumber);
}
}
if (answer == "1")
{
Console.WriteLine("what letter do you want to insert to your tree?");
char letter = char.Parse(Console.ReadLine());
newtree.insert(letter);
}
if (answer == "3")
{
newtree.Print();
}
if (answer == "2")
{
Console.WriteLine("what letter are you searching?");
char lettersearch = char.Parse(Console.ReadLine());
if (newtree.Search(lettersearch) == false)
{
Console.WriteLine("no, it does not have that letter");
}
if (newtree.Search(lettersearch) == true)
{
Console.WriteLine("yes, it has that letter");
}
}
if (answer == "5")
{
Console.WriteLine("what letter do you want to insert to delete from your tree?");
char deleter = char.Parse(Console.ReadLine());
newtree.Remove(deleter);
}
if (answer == "6")
{
newtree.PreOrderPrint();
Console.WriteLine("done.");
}
if (answer == "7")
{
newtree.PostOrderPrint();
Console.WriteLine("done.");
}
if (answer == "8")
{
newtree.InOrderPrint();
Console.WriteLine("done.");
}
} while (answer != "quit");
}
