public void Remove(DoubleLinkedListNode <T> node) { if (node.NextNode == node) { LastNode = null; } else { node.NextNode.PrevNode = node.PrevNode; node.PrevNode.NextNode = node.NextNode; if (node == LastNode) { LastNode = node.PrevNode; } } }
public void Restore(DoubleLinkedListNode <T> node) { node.PrevNode.NextNode = node; node.NextNode.PrevNode = node; }
public void InsertBegining(DoubleLinkedListNode <T> newNode) { InsertAfter(LastNode, newNode); }