/// <summary> /// This method is used to test the Linked Lists in the console. /// </summary> static void TestLL() { LinkdList ll = new LinkdList(new Node(10)); ll.Add(new Node(15)); ll.Add(new Node(20)); ll.Print(); // 20 -> 15 -> 10 -> NULL; Console.WriteLine(); Console.WriteLine("Let's find Node 10"); Node found = ll.Find(10); Console.WriteLine(found.Value); Node n3 = new Node(27); Node n6 = new Node(12); Node n7 = new Node(24); ll.AddBefore(n3, ll.Find(15)); ll.AddAfter(n6, ll.Find(27)); ll.AddLast(n7); ll.Print(); Console.WriteLine(); // 20 -> 27 -> 12 -> 15 -> 10 -> 24 -> NULL; }
public static void Main(string[] args) { Node node1 = new Node("A"); Node node2 = new Node("N"); Node node3 = new Node("N"); Node node4 = new Node("A"); LinkdList list1 = new LinkdList(node1); list1.Append(node2); list1.Append(node3); list1.Append(node4); Console.WriteLine("First Linked List Test:"); list1.Print(); Console.WriteLine($"\nIs Palindrome: {PalindromeCheck(list1)}"); Node node5 = new Node("A"); Node node6 = new Node("B"); Node node7 = new Node("C"); Node node8 = new Node("D"); LinkdList list2 = new LinkdList(node5); list2.Append(node6); list2.Append(node7); list2.Append(node8); Console.WriteLine("\nSecond Linked List Test:"); list2.Print(); Console.WriteLine($"\nIs Palindrome: {PalindromeCheck(list2)}"); }
public static void Main(string[] args) { Node node1 = new Node(10); Node node2 = new Node(20); Node node3 = new Node(30); Node node4 = new Node(40); Node node5 = new Node(50); LinkdList LL1 = new LinkdList(node1); LL1.Append(node2); LL1.Append(node3); LL1.Append(node4); LL1.Append(node5); Node node6 = new Node(60); Node node7 = new Node(70); Node node8 = new Node(80); Node node9 = new Node(90); Node node10 = new Node(100); Node node11 = new Node(110); Node node12 = new Node(120); LinkdList LL2 = new LinkdList(node6); LL2.Append(node7); LL2.Append(node8); LL2.Append(node9); LL2.Append(node10); LL2.Append(node11); LL2.Append(node12); Console.WriteLine("Linked List 1:"); LL1.Print(); Console.WriteLine("\nLinked List 2:"); LL2.Print(); Console.WriteLine("\nMerged Link Lists:"); MergeLists(LL1, LL2); LL1.Print(); }
public static void Merge() { Node n1 = new Node(10); Node n2 = new Node(20); Node n3 = new Node(30); Node n4 = new Node(40); LinkdList LL1 = new LinkdList(n4); LL1.Add(n3); LL1.Add(n2); LL1.Add(n1); LL1.Add(new Node(0)); LL1.Add(new Node(100)); Node n1_2 = new Node(5); Node n2_2 = new Node(15); Node n3_2 = new Node(25); Node n4_2 = new Node(35); LinkdList LL2 = new LinkdList(n4_2); LL2.Add(n3_2); LL2.Add(n2_2); LL2.Add(n1_2); LL1.Print(); // 100 --> 0 --> 10 --> 20 --> 30 --> 40 --> NULL Console.WriteLine(); LL2.Print(); // 5 --> 15 --> 25 --> 35 --> NULL Console.WriteLine(); Node head = LL1.Merge(LL1, LL2); LL1.Print(); // 100 --> 5 --> 0 --> 15 --> 10 --> 25 --> 20 --> 35 --> 30 --> 40 --> NULL Console.WriteLine(); }
static void Main(string[] args) { LinkdList lista = new LinkdList(); lista.AddOrdered(10); lista.AddOrdered(1); lista.AddOrdered(5); lista.AddOrdered(14); lista.AddOrdered(3); lista.AddOrdered(999999); lista.Print(); Console.WriteLine(); Console.WriteLine(); Console.WriteLine($"Resultado -> [ {lista.Find(5)} ]"); }
static void Main(string[] args) { Node node1 = new Node("A"); Node node2 = new Node("B"); Node node3 = new Node("C"); Node node4 = new Node("D"); LinkdList list = new LinkdList(node1); list.Append(node2); list.Append(node3); list.Append(node4); Console.WriteLine("Original Linked List:"); list.Print(); Console.WriteLine("\nReversed Linked List:"); ReverseLL(list).Print(); }
static void Main(string[] args) { Console.WriteLine("Hello World!\n"); Node node1 = new Node(0, 7); Node node2 = new Node(0, "cat"); Node node3 = new Node(0, "dog"); Node node4 = new Node(0, 14); Node node5 = new Node(0, "bird"); LinkdList list = new LinkdList(node1); list.Add(node2); list.Append(node3); list.AddBefore(node4, node1); list.AddAfter(node5, node3); list.Print(); object searchTerm = 14; Node foundNode = list.Find(searchTerm); Console.WriteLine($"You searched for {searchTerm} and found {foundNode.Value}"); }