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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!