public void Insert(int index, LinearLinkListNode <T> value) { if (index < 0) { throw new ArgumentException(); } var node = Head; for (int i = 0; i < index; i++) { if (node == null) { throw new ArgumentException(); } else { node = node.Next; } } var temp = node.Next; node.Next = value; if (value != null) { value.Next = temp; } }
public LinearLinkList() { Head = new LinearLinkListNode <T>(); }