Question: 2) Reverse the singly linked list and return the head of list. For Example: head>1>5>6 >8>NULL, after function linked list will become head>8>6>5>1>NULL 3) Find
2) Reverse the singly linked list and return the head of list.
For Example: head>1>5>6 >8>NULL, after function linked list will become
head>8>6>5>1>NULL
3) Find the minimum and maximum element in doubly linked list using recursion.
Solve this using c++ only
Using recursion
And do not use vectors
Data structures in C++
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
