Exercise 4 that takes as input a non-empty (singly) linked list L and returns its reverse. Describe carefully in English a fast recursive algorithm areful: singly linked list are not provided with a pointer to their last entry; yet your solution should not try to find the last entry by making a traversal of the list. Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .