/// <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 void LLCanFind(object value) { Node node1 = new Node(0, 7); Node node2 = new Node(0, "cat"); Node node3 = new Node(0, "dog"); Node node4 = new Node(0, value); LinkdList list = new LinkdList(node1); list.Append(node2); list.Append(node3); list.Append(node4); Assert.Equal(value, list.Find(value).Value); }
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)} ]"); }
public void ReturnsNullForNodeThatDoesNotExist(int value) { // Arrange LinkdList ll = new LinkdList(new Node(4)); Node node = new Node(8); Node node2 = new Node(15); Node node3 = new Node(16); Node node4 = new Node(23); // Act ll.Add(node); ll.Add(node2); ll.Add(node3); ll.Add(node4); Node found = ll.Find(value); // Assert Assert.Null(found); }
public void CanFindNodeThatExists(int value, int expected) { //Arrange LinkdList ll = new LinkdList(new Node(4)); Node node = new Node(8); Node node2 = new Node(15); Node node3 = new Node(16); Node node4 = new Node(23); ll.Add(node); ll.Add(node2); ll.Add(node3); ll.Add(node4); //Act Node found = ll.Find(value); //Assert Assert.Equal(expected, found.Value); }
public void ReturnsNullForNodeThatDoesNotExist(int value) { // Arrange LinkdList ll = new LinkdList(new Node(10)); // Act ll.Add(new Node(20)); ll.Add(new Node(30)); ll.Add(new Node(40)); ll.Add(new Node(50)); ll.Add(new Node(60)); ll.Add(new Node(70)); ll.Add(new Node(65)); ll.Add(new Node(100)); ll.Add(new Node(7)); Node found = ll.Find(value); // Assert Assert.Null(found); }
public void CanFindNodeThatExists(int value, int expected) { // Arrange LinkdList ll = new LinkdList(new Node(10)); ll.Add(new Node(20)); ll.Add(new Node(30)); ll.Add(new Node(40)); ll.Add(new Node(50)); ll.Add(new Node(60)); ll.Add(new Node(70)); ll.Add(new Node(65)); ll.Add(new Node(100)); ll.Add(new Node(7)); // Act Node result = ll.Find(value); // Assert Assert.Equal(expected, result.Value); }
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}"); }