void function ( int arg0 ) { Node loc0 = new Node ( arg0 ) ; if ( head == null ) { head = loc0 ; return ; } Node loc1 = head ; while ( loc1 . next != null ) { loc1 = loc1 . next ; } loc1 . next = loc0 ; return ; }
add new node to list concode_field_sep Node head concode_field_sep void removeAllNodes concode_elem_sep void print concode_elem_sep Node getHead concode_elem_sep void printKthFromLast concode_elem_sep int printKthFromLast concode_elem_sep void reverseRecursvive concode_elem_sep void initialize concode_elem_sep void removeDuplicate concode_elem_sep void reverse concode_elem_sep Node reverse concode_elem_sep void arrangeEvenOddPosition concode_elem_sep void remove concode_elem_sep void removeNode concode_elem_sep void swapeParis