Delete duplicate-value nodes from a sorted linked list

  • + 15 comments

    This works too:

    Node RemoveDuplicates(Node head) {
      if ( head == null ) return null;
      Node nextItem = head.next;
      while ( nextItem != null && head.data == nextItem.data ) {
        nextItem = nextItem.next;
      }
      head.next = RemoveDuplicates( nextItem );
      return head;
    }