Node < MyType > function ( ) { if ( head == null ) return null ; if ( head . next == null ) { Node < MyType > loc0 = head ; head = null ; return loc0 ; } Node < MyType > loc1 = head ; while ( loc1 . next != null && loc1 . next . next != null ) loc1 = loc1 . next ; Node < MyType > loc2 = loc1 . next ; loc1 . next = null ; return loc2 ; }
remove from the end of list in o n concode_field_sep Node<MyType> head concode_field_sep void addLast concode_elem_sep Node<MyType> find concode_elem_sep Node<MyType> removeFirst concode_elem_sep String toString concode_elem_sep Node<MyType> delete concode_elem_sep void addFirst concode_elem_sep Node<MyType> findPrevNode