1. You are given a partially written LinkedList class. 2. You are required to complete the body of fold function. The function is expected to place last element after 1st element, 2nd last element after 2nd element and so on. For more insight check the example Example 1 1->2->3->4->5 will fold as 1->5->2->4->3 Example 2 1->2->3->4->5->6 1->6->2->5->3->4
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
1. Time complexity -> O(n) 2. Space complexity -> Recursion space, O(n)
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
5 1 2 3 4 5 10 20
Output
1 2 3 4 5 1 5 2 4 3 10 1 5 2 4 3 20