public DoblyLinkedListNode <T> searchList(T search) { DoblyLinkedListNode <T> node = new DoblyLinkedListNode <T>(search); DoblyLinkedListNode <T> currentNode = this.Head; while (currentNode != null) { if (currentNode.Value.Equals(node.Value)) { return(currentNode); } currentNode = currentNode.Next; } return(null); }
public void insertAtEnd(T insert) { DoblyLinkedListNode <T> newNode = new DoblyLinkedListNode <T>(insert); if (this.Count == 0) { this.Head = newNode; } else { newNode.Previous = this.Tail; this.Tail.Next = newNode; } this.Tail = newNode; this.Count++; }