Algo#44: Modify linked list to put nodes alternate from begin & end

To modify linked list to put nodes alternate from begin & end, we will use recursion. So we can access nodes in forward and reverse direction simultaneously. And we don't need to go back and forth to access nodes from begin and end.

Following is implementation of above problem in c language.

Please write comments if you find anything wrong or you want to add something more related to this topic.