question: this has time complexity of o n and space complexity of o n as well because recursion would be used n no . of times , which uses stack internally . concode_field_sep Node head concode_elem_sep Node next concode_elem_sep int data concode_field_sep Node Delete concode_elem_sep void deleteAt concode_elem_sep void setData concode_elem_sep void reverseListPrint concode_elem_sep void reverseListPrint concode_elem_sep void insertAt concode_elem_sep void deleteLast concode_elem_sep boolean isEmpty concode_elem_sep boolean isCycle concode_elem_sep void insert concode_elem_sep void reverseList concode_elem_sep int fetchLast concode_elem_sep Node getNext concode_elem_sep void delete concode_elem_sep int fetchFirst concode_elem_sep Node InsertNth concode_elem_sep Node InsertNth concode_elem_sep void ReversePrint concode_elem_sep void traverse concode_elem_sep void reverseListRecursive concode_elem_sep int fetch concode_elem_sep void deleteFirst concode_elem_sep void setNext concode_elem_sep void insertLast concode_elem_sep int getData
target: Node function ( Node arg0 ) { if ( arg0 == null ) { return null ; } Node loc0 = reverseListRescursive ( arg0 . next ) ; if ( loc0 == null ) { head . next = arg0 ; } else { loc0 . next = arg0 ; } return arg0 ; }