Purpose of the given code: The given code is trying to remove a value from the linked list; the value to be removed is stored in the variable “num”. Given Code: //Definition of function void NumberList::deleteNode(double num)//Line 1 {//Line 2 //Declaration of structure pointer variable ListNode nodePtr, previousNode; //Line 3 // If the list is empty, do nothing if (!head)//Line 4 return;//Line 5 //Determine if the first node is the one if (head->value == num)//Line 6 //Error #1 //Delete “head” value delete head;//Line 7 //Error #2 else//Line 8 {//Line 9 // Initialize nodePtr to head of list nodePtr = head;//Line 10 /* Skip all nodes whose value member is not equal to num / while (nodePtr->value != num)//Line 11 {//Line 12 previousNode = nodePtr;//Line 13 nodePtr = nodePtr->next;//Line 14 }//Line 15 / link the previous node to the node after nodePtr, then delete nodePtr */ previousNode->next = nodePtr->next;//Line 16 delete nodePtr;//Line 17 }//Line 18 }//Line 19

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 34RQE

Program Plan Intro

Purpose of the given code:

The given code is trying to remove a value from the linked list; the value to be removed is stored in the variable “num”.

Given Code:

//Definition of function

void NumberList::deleteNode(double num)//Line 1

{//Line 2

//Declaration of structure pointer variable

ListNode nodePtr, previousNode; //Line 3

// If the list is empty, do nothing

if (!head)//Line 4

return;//Line 5

//Determine if the first node is the one

if (head->value == num)//Line 6

//Error #1

//Delete “head” value

delete head;//Line 7

//Error #2

else//Line 8

{//Line 9

// Initialize nodePtr to head of list

nodePtr = head;//Line 10

/* Skip all nodes whose value member is not equal to num /

while (nodePtr->value != num)//Line 11

{//Line 12

previousNode = nodePtr;//Line 13

nodePtr = nodePtr->next;//Line 14

}//Line 15

/ link the previous node to the node after nodePtr, then delete nodePtr */

previousNode->next = nodePtr->next;//Line 16

delete nodePtr;//Line 17

}//Line 18

}//Line 19

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build a C++ program based on the appropriate method/function. You are free to create your own menu and display. Consider the following case: You have been appointed as a teacher of 3 Gemilang class in SMK Tanjung Malim. Please create a program that can keep the name list of your students in the class. The list must consist of two lists, first list is for all female student's names and the second list is for all male student's names. You must also provide the list of all the student's name. In order to do that, you need to merge both of the list together. The name in the list needs to be sorted alphabetically. The program must consist of the following method function: a) menu() – as interface for the user b) add list(string) – to add name to the list c) sort list() – to sort the name in the list d) show list) – to display the lists e) search list(string) – to search a name in the list ) merge…

struct remove_from_front_of_dll { // Function takes no parameters, removes the book at the front of a doubly // linked list, and returns nothing. void operator()(const Book& unused) { //// TO-DO (13) |||| // Write the lines of code to remove the book at the front of "my_dll", // // Remember, attempting to remove an element from an empty data structure is // a logic error. Include code to avoid that. ///// END-TO-DO (13) //// } std::list& my_dll; };

T/F: All Linked Lists must have head node.