public void AddAfter(T data, SimpleLinkedNode <T> previous) { var node = new SimpleLinkedNode <T>(data); node.Next = previous.Next; previous.Next = node; }
public void AddFirst(T data) { var node = new SimpleLinkedNode <T>(data); node.Next = First; First = node; }
public T Remove(SimpleLinkedNode <T> node) { var current = First; while (current.Next != node) { current = current.Next; } current.Next = node.Next; var val = node.Data; node = null; return(val); }
public SimpleLinkedList(T first) { var node = new SimpleLinkedNode <T>(first); First = node; }
public void Add(SimpleLinkedNode <T> node) { Last.Next = node; }
public void Add(T data) { var node = new SimpleLinkedNode <T>(data); Last.Next = node; }