154 lines
2.1 KiB
C#
154 lines
2.1 KiB
C#
using System;
|
|
using C_.Datastructures.DoublyLinkedList;
|
|
using C_.Datastructures.BinaryTree;
|
|
using C_.Datastructures.Heap;
|
|
|
|
// See https://aka.ms/new-console-template for more information
|
|
Console.WriteLine("Hello, World!");
|
|
|
|
|
|
//LinkedList<int> list = new LinkedList<int>();
|
|
|
|
//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<int> list = new DoublyLinkedList<int>();
|
|
|
|
// list.Append(1);
|
|
// list.Append(2);
|
|
// list.Append(3);
|
|
// list.Append(4);
|
|
// list.Append(5);
|
|
// list.Append(6);
|
|
// list.Insert(6, 1);
|
|
|
|
// list.Delete(0);
|
|
|
|
// 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<int> stack = Stack<int>.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<int> queue = Queue<int>.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<int> tree = new Tree<int>();
|
|
|
|
//tree.Add(40);
|
|
//tree.Add(30);
|
|
//tree.Add(50);
|
|
//tree.Add(25);
|
|
//tree.Add(35);
|
|
//tree.Add(45);
|
|
//tree.Add(60);
|
|
//tree.Add(15);
|
|
//tree.Add(28);
|
|
//tree.Add(55);
|
|
//tree.Add(70);
|
|
|
|
|
|
////var x = tree.Delete(10);
|
|
////tree.Delete(5);
|
|
|
|
//var inorder = tree.Traverse(TraversalType.Inorder);
|
|
//var preorder = tree.Traverse(TraversalType.Preorder);
|
|
//var postorder = tree.Traverse(TraversalType.Postorder);
|
|
//var breadthFirst = tree.Traverse(TraversalType.Breadth);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
var x = HeapNode<int>.Create(1, null, new HeapNode<int> { Left = default, Right = default });
|
|
|
|
Console.ReadLine();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|