91Ó°ÊÓ

\(\mathrm{T} \quad \mathrm{F} \quad\) Linked lists are not superior to STL vectors.

\(\mathrm{T} \quad \mathrm{F} \quad\) A class that builds a linked list should destroy the list in the class destructor.

Find as many mistakes as you can. void NumberList::appendNode(double num) { ListNode *newNode, *nodePtr; // Allocate a new node & store num newNode = new listNode; newNode->value = num; // If there are no nodes in the list // make newNode the first node. if (!head) head = newNode; else // Otherwise, insert newNode. { // Find the last node in the list. while (nodePtr->next) nodePtr = nodePtr->next; // Insert newNode as the last node. nodePtr->next = newNode; } }

Find as many mistakes as you can. void NumberList::deleteNode(double num) { ListNode *nodePtr, *previousNode; // If the list is empty, do nothing. if (!head) return; // Determine if the first node is the one. if (head->value == num) delete head; else { // Initialize nodePtr to head of list. nodePtr = head; // Skip all nodes whose value member is // not equal to num. while (nodePtr->value != num) { previousNode = nodePtr; nodePtr = nodePtr->next; } // Link the previous node to the node after // nodePtr, then delete nodePtr. previousNode->next = nodePtr->next; delete nodePtr; } }

Find as many mistakes as you can. NumberList::~NumberList() { ListNode *nodePtr, *nextNode; nodePtr = head; while (nodePtr != nullptr) { nextNode = nodePtr->next; nodePtr->next = nullptr; nodePtr = nextNode; } }