public SinglyLinkedList(T value) { var node = new SinglyLinkedListNode <T>(value); Head = node; Tail = node; listSize = 1; }
public T RemoveLast() { if (IsEmpty()) { throw new InvalidOperationException("List is empty."); } var node = Tail; Tail = Tail.Next; listSize--; return(node.Value); }
public void AddFirst(T value) { var node = new SinglyLinkedListNode <T>(value); if (IsEmpty()) { Head = node; Tail = node; } else { node.Next = Head; Head = node; } listSize++; }