Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
What does this part of code do? void addRecord(Node *& head, Node *& tail, string name, double balance){     Node *newNode = new Node;     newNode->name = name;     newNode->balance = balance;     newNode->next = NULL;     newNode->prev = NULL;     // If list is empty, make newNode the first node     if(head == NULL){         head = newNode;         tail = newNode;     }     else{         Node *temp = head;         // Loop through list until temp->next is NULL         while(temp->next != NULL){             temp = temp->next;         }         temp->next = newNode;         newNode->prev = temp;         tail = newNode;     } } /*

What does this part of code do? void addRecord(Node *& head, Node *& tail, string name, double balance){     Node *newNode = new Node;     newNode->name = name;     newNode->balance = balance;     newNode->next = NULL;     newNode->prev = NULL;     // If list is empty, make newNode the first node     if(head == NULL){         head = newNode;         tail = newNode;     }     else{         Node *temp = head;         // Loop through list until temp->next is NULL         while(temp->next != NULL){             temp = temp->next;         }         temp->next = newNode;         newNode->prev = temp;         tail = newNode;     } } /*

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

What does this part of code do?

void addRecord(Node *& head, Node *& tail, string name, double balance){
    Node *newNode = new Node;
    newNode->name = name;
    newNode->balance = balance;
    newNode->next = NULL;
    newNode->prev = NULL;
    // If list is empty, make newNode the first node
    if(head == NULL){
        head = newNode;
        tail = newNode;
    }
    else{
        Node *temp = head;
        // Loop through list until temp->next is NULL
        while(temp->next != NULL){
            temp = temp->next;
        }
        temp->next = newNode;
        newNode->prev = temp;
        tail = newNode;
    }
}

/*

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Lists
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
  • SEE MORE 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
SEE MORE TEXTBOOKS