public static void Main()
{
BinaryTree binaryTree = new BinaryTree();
binaryTree.Add(40);
binaryTree.Add(20);
binaryTree.Add(50);
binaryTree.Add(25);
binaryTree.Add(60);
binaryTree.Add(100);
binaryTree.Add(1);
Console.WriteLine(" finding 1 : " + binaryTree.Find(1).ToString());
Console.WriteLine(" finding 100 : " + binaryTree.Find(100).ToString());
Console.WriteLine(" finding 1000 : " + binaryTree.Find(1000).ToString());
Console.WriteLine(" finding 50 : " + binaryTree.Find(50).ToString());
Console.WriteLine("Preorder traversal : "); binaryTree.PreOrderTraversal(binaryTree.currentObject);
Console.WriteLine("InOrder Traverssal : "); binaryTree.InOrderTraversal(binaryTree.currentObject);
Console.WriteLine("PostOrder Traversal : "); binaryTree.PostOrderTraversal(binaryTree.currentObject);
Console.ReadLine();
}
static void Main(string[] args)
{
//#region Linked List Showcase
//LinkedList<string> linkedList = new LinkedList<string>();
//linkedList.AddToLinkedList("A");
//linkedList.AddToLinkedList("B");
//linkedList.AddToLinkedList("C");
//linkedList.AddToLinkedList("D");
//linkedList.PrintElement();
//Console.WriteLine(string.Format("Element found: {0}", linkedList.Contains("B")));
//Console.WriteLine(string.Format("Element found: {0}", linkedList.Contains("E")));
//linkedList.DeleteNode("C");
//linkedList.PrintElement();
//#endregion
//#region Stack Showcase
//Stack<int> stack = new Stack<int>();
//for (int i = 0; i < 5; i++)
//{
// Console.WriteLine("Push: {0}", i + 1);
// stack.Push(i + 1);
//}
//Console.WriteLine("\n");
//Console.WriteLine("Peek: {0}", stack.Peek());
//Console.WriteLine("\n");
//while (!stack.IsEmpty())
//{
// Console.WriteLine("Pop: {0}", stack.Pop());
//}
//#endregion
//#region Queue Showcase
//Console.WriteLine("\n");
//Queue<int> queue = new Queue<int>();
//for (int i = 0; i < 5; i++)
//{
// Console.WriteLine("EnQueue: {0}", i + 1);
// queue.EnQueue(i + 1);
//}
//Console.WriteLine("\n");
//Console.WriteLine("Front: {0}", queue.GetFront());
//Console.WriteLine("\n");
//while (!queue.IsEmpty())
//{
// Console.WriteLine("DeQueue: {0}", queue.DeQueue());
//}
//#endregion
BinarySearchTree bst = new BinarySearchTree();
bst.AddElement(2);
//for (int i = 1; i <= 20; i = i + 1)
// bst.AddElement(i);
BinaryTreeNode <int> btn = new BinaryTreeNode <int>(1, null, null);
btn.Left = new BinaryTreeNode <int>(2, new BinaryTreeNode <int>(4, new BinaryTreeNode <int>(7, null, null), null), new BinaryTreeNode <int>(5, null, null));
btn.Right = new BinaryTreeNode <int>(3, null, null);
Console.WriteLine("\nIn-order traversal");
BinaryTree <int> .InOrderTraversal(btn);
Console.WriteLine("\n\nPreorder traversal");
BinaryTree <int> .PreOrderTraversal(btn);
Console.WriteLine("\n\nPostorder traversal");
BinaryTree <int> .PostOrderTraversal(btn);
Console.WriteLine("\n\nHeight: {0}", BinaryTree <int> .GetHeight(btn));
Console.WriteLine("\n\n Ancestors");
//BinaryTree<int>.GetAncestors(btn, 4);
//BinaryTree<int>.GetAncestors(btn, 3);
//BinaryTree<int>.GetAncestors(btn, 7);
//BinaryTree<int>.GetAncestors(btn, 1);
//BinaryTree<int>.GetAncestors(btn, 8);
BinaryTree <int> .GetAncestors(btn, 4);
Console.WriteLine("\n\nKth Ancestors");
BinaryTree <int> .GetKthAncestors(btn, 7, 1);
Console.WriteLine("\n\nLevel order traversal::");
BinaryTree <int> .LevelOrderTraversal(btn);
Console.Write("\n\nLevel: ");
BinaryTree <int> .PrintLevel(btn, 1);
Console.Write("\n\n Node count at Level: {0}", BinaryTree <int> .GetNodesCountAtLevel(btn, 1));
Console.ReadLine();
}
