public ListNodeTicket(DoubleLinkedList <T> .LinkedNodeElement newElement)
{
this.node = newElement;
}
private LinkedTail tail; //useful having pointer to tail for end adding?
public LinkedHead(DoubleLinkedList <T> list)
{
this.tail = new LinkedTail(list);
this.setNextNode(tail);
tail.setPreviousNode(this);
}
public LinkedNodeElement(DoubleLinkedList <T> list)
{
this.ownerList = list;
}
public LinkedNodeElement(T element, DoubleLinkedList <T> list)
{
this.ownerList = list;
this.element = element;
}
public LinkedTail(DoubleLinkedList <T> list) : base(list)
{
this.prevNode = list.head;
}