private DNode <T> FindLastNode(DLinkedList <T> dLinkedList) { DNode <T> find = dLinkedList.head; while (find.next != null) { find = find.next; } return(find); }
public DoublyLinkedList() { dLinkedList = new DLinkedList <T>(); }
private DNode <T> FindLastNode(DLinkedList <T> dLinkedList) { DNode <T> find = dLinkedList.head; while (find.next != null) { find = find.next; } return(find); }
public DoublyLinkedList() { dLinkedList = new DLinkedList <T>(); }