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 17, 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

class Node: def __init__(self, e, n): self.element = e self.next = n class LinkedList: def __init__(self, a): # Design the constructor based on data type of a. If 'a' is built in python list then # Creates a linked list using the values from the given array. head will refer # to the Node that contains the element from a[0] # Else Sets the value of head. head will refer # to the given LinkedList # Hint: Use the type() function to determine the data type of a self.head = None # To Do # Count the number of nodes in the list def countNode(self): # To Do # Print elements in the list def printList(self): # To Do # returns the reference of the Node at the given index. For invalid index return None. def nodeAt(self, idx): # To Do

Grocery shopping list (linked list: inserting at the end of a list) Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts

Functions that look at a linked list but do not modify it are referred to as______________