public void AddEnd() { DoublyLinkedList <int> list = new DoublyLinkedList <int>(); list.AddEnd(0); list.AddEnd(1); list.AddEnd(2); int i = 0; foreach (var num in list) { Assert.True(num == i); i++; } }
public void Remove(int[] data, int remove) { DoublyLinkedList <int> list = new DoublyLinkedList <int>(); for (int i = data.Length - 1; i >= 0; i--) { list.AddEnd(data[i]); } var temp = list; list.Remove(remove); var listNum = list.Head; foreach (int num in temp) { if (remove != num) { Assert.True(num == listNum.item); listNum = listNum.Next; } } //Check to see if list is equivalent to data except for portion with deletion. }
public void RemoveEnd(int[] data) { DoublyLinkedList <int> list = new DoublyLinkedList <int>(); for (int i = 0; i < data.Length; i++) { list.AddEnd(data[i]); } list.RemoveEnd(); int j = 0; foreach (int num in list) { if (num == data[j]) { Assert.True(true); } else { j++; Assert.True(num == data[j]); } j++; } }
public void Should_create_doubly_linked_list_having_multiple_nodes_using_add_end() { // arrange var card2 = Card.Hearts(2); var card4 = Card.Hearts(4); var card6 = Card.Hearts(6); var list = new DoublyLinkedList <Card>(); // act list.AddEnd(card2); list.AddEnd(card4); list.AddEnd(card6); // assert Assert.AreEqual(expected: 3, actual: list.Count); Assert.AreEqual(expected: card2, actual: list.Head.Value); Assert.AreEqual(expected: card6, actual: list.Tail.Value); }