Node < T > function ( T arg0 ) { if ( head == null ) return null ; Node < T > loc0 = head ; while ( loc0 != null && ! loc0 . data . equals ( arg0 ) ) loc0 = loc0 . next ; return loc0 ; }
find the first node containing value concode_field_sep Node<T> head concode_field_sep int size concode_elem_sep Node<T> removeFirst concode_elem_sep boolean isEmpty concode_elem_sep String toString concode_elem_sep Node<T> delete concode_elem_sep void addFirst