C++ NOTES FROM MY TEACHER: okay, first your gonna need to set your curPtr to null. Otherwise, the while is just not going to run. I'm assuming your next is the new head pointer so u should be setting that to the tail pointer since you are reversing. I suggest u change the parameters to loop through the entire list, so u might want to create a variable that goes from 0 to the end of your list and increases every time the while is running and will stop once it gets past the item count otherwise it's going to go on forever. Also put some if statements inside the while for cases where it the beginning of the list, end of the list, and in between the list ur gonna need those because, since its a doubly-linked list, ur also going to have to change the pointers to and from the Null pointers Please help me fix my reverse function C++
C++
NOTES FROM MY TEACHER: okay, first your gonna need to set your curPtr to null. Otherwise, the while is just not going to run. I'm assuming your next is the new head pointer so u should be setting that to the tail pointer since you are reversing. I suggest u change the parameters to loop through the entire list, so u might want to create a variable that goes from 0 to the end of your list and increases every time the while is running and will stop once it gets past the item count otherwise it's going to go on forever. Also put some if statements inside the while for cases where it the beginning of the list, end of the list, and in between the list ur gonna need those because, since its a doubly-linked list, ur also going to have to change the pointers to and from the Null pointers
Please help me fix my reverse function C++
In order to reverse a doubly linked list all we need to do is swap prev and next pointers for all nodes, change prev of the head and change the head pointer in the end.
Node Structure:
class Node
{
public:
int value;
Node *next;
Node *prev;
};
Step by step
Solved in 2 steps
