using System; using C_.Datastructures.BinaryTree; // See https://aka.ms/new-console-template for more information Console.WriteLine("Hello, World!"); //LinkedList list = new LinkedList(); //list.Append(1); //list.Append(2); //list.Append(3); //list.Append(4); //list.Append(5); //list.Append(6); //list.Delete(5); //list.Delete(2); //list.Delete(0); // DoublyLinkedList list = new DoublyLinkedList(); // list.Append(1); // list.Append(2); // list.Append(3); // list.Append(4); // list.Append(5); // list.Append(6); // list.Insert(6, 1); // Console.Write($"{list[0]} "); // Console.Write($"{list[1]} "); // Console.Write($"{list[2]} "); // Console.Write($"{list[3]} "); // Console.Write($"{list[4]} "); // Console.Write($"{list[5]} "); // Console.Write($"{list[6]} \n"); //Stack stack = Stack.Create(); //stack.Push(1); //stack.Push(2); //stack.Push(3); //stack.Push(4); //stack.Push(5); //stack.Push(6); //Console.WriteLine(stack.Peek()); //stack.Pop(); //stack.Push(7); //stack.Pop(); //stack.Pop(); //stack.Pop(); //stack.Pop(); //stack.Pop(); //stack.Pop(); //Queue queue = Queue.Create(); //queue.Push(1); //queue.Push(2); //queue.Push(3); //queue.Push(4); //queue.Push(5); //queue.Push(6); //Console.WriteLine(queue.Peek()); //queue.Pop(); //queue.Push(7); //queue.Pop(); //queue.Pop(); //queue.Pop(); //queue.Pop(); //queue.Pop(); //queue.Pop(); Tree tree = new Tree(); tree.Add(4); tree.Add(5); tree.Add(7); tree.Add(6); tree.Add(2); tree.Add(3); tree.Add(1); tree.Add(4); tree.Add(7); var x = tree.Find(2); Console.ReadLine();