void function ( MyType arg0 ) { if ( head == null ) { head = new Node < > ( arg0 ) ; return ; } Node < MyType > loc0 = head ; while ( loc0 . next != null ) loc0 = loc0 . next ; loc0 . next = new Node < > ( arg0 ) ; }
add to the end of the list in o n concode_field_sep Node<MyType> head concode_field_sep Node<MyType> find concode_elem_sep Node<MyType> removeFirst concode_elem_sep String toString concode_elem_sep Node<MyType> removeLast concode_elem_sep Node<MyType> delete concode_elem_sep void addFirst concode_elem_sep Node<MyType> findPrevNode