public void remove(T x) { LinkedListIterator <T> p = findPrevious(x); if (p.Current.Next != null) { p.Current.Next = p.Current.Next.Next; } }
public static void printList(MyLinkedList <T> theList) { if (theList.isEmpty()) { Console.WriteLine("Empty List"); } else { LinkedListIterator <T> itr = theList.first(); while (itr.isValid()) { Console.Write(itr.retrieve() + " "); itr.advance(); } } }