C++ DOUBLY LINKED LIST: Implement the remove_between function for my code: This function removes the inserted/ added node in the add_between function. Provided code: class DoublyLinkedList : public List {     node* head;     node* tail;     int index;     node* create_node(int num, node* predecessor, node* successor) {         node* n = (node*) malloc( sizeof(node) );         n->element = num;         n->next = successor;         n->prev = predecessor;         return n;     }     void add_between(int num, node* predecessor, node* successor) {         node* newest = create_node(num, predecessor, successor);         predecessor->next = newest;         successor->prev = newest;         index++;     }     void remove_between(int num, node* predecessor, node* successor) {       ///// CODE HERE     }

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++ DOUBLY LINKED LIST:

Implement the remove_between function for my code:

  • This function removes the inserted/ added node in the add_between function.

Provided code:

class DoublyLinkedList : public List {
    node* head;
    node* tail;
    int index;

    node* create_node(int num, node* predecessor, node* successor) {
        node* n = (node*) malloc( sizeof(node) );
        n->element = num;
        n->next = successor;
        n->prev = predecessor;
        return n;
    }

    void add_between(int num, node* predecessor, node* successor) {
        node* newest = create_node(num, predecessor, successor);
        predecessor->next = newest;
        successor->prev = newest;
        index++;
    }

    void remove_between(int num, node* predecessor, node* successor) {


      ///// CODE HERE

    }

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Operations of Linked List
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.
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