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++

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

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++

 

Expert Solution
Step 1 : Theory

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;  
}; 

 

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education