#include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *ptr, list; list = new ListNode; list->data = "New York"; ptr - new ListNode; ptr->data - "Boston"; list->next - ptr; ptr->next= new ListNode; ptr->next->data - "Houston"; ptr->next->next = nullptr; // new code goes here Which of the following code correctly deletes the last node the list when added at point of insertion indicated above? O delete ptr->next; ptr->next = nullptr;; O ptr = list: while (ptr != nullptr) ptr = ptr->next; delete ptr; ptr = last; delete ptr; list->next->next = nullptr; delete ptr;

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
Question 9
#include <iostream>
using namespace std;
struct ListNode {
string data;
ListNode *next;
};
int main() {
ListNode *ptr, *list;
list = new ListNode;
list->data = "New York";
ptr = new ListNode;
ptr->data = "Boston";
list->next = ptr;
ptr->next = new ListNode;
ptr->next->data = "Houston";
ptr->next->next = nullptr;
// new code goes here
Which of the following code correctly deletes the last node of the list when added at point of insertion indicated above?
O delete ptr->next;
ptr->next = nullptr;;
O ptr = list;
while (ptr != nullptr)
ptr = ptr->next;
delete ptr;
O ptr = last;
delete ptr;
list->next->next =
nullptr;
delete ptr;
O None of these
Transcribed Image Text:Question 9 #include <iostream> using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *ptr, *list; list = new ListNode; list->data = "New York"; ptr = new ListNode; ptr->data = "Boston"; list->next = ptr; ptr->next = new ListNode; ptr->next->data = "Houston"; ptr->next->next = nullptr; // new code goes here Which of the following code correctly deletes the last node of the list when added at point of insertion indicated above? O delete ptr->next; ptr->next = nullptr;; O ptr = list; while (ptr != nullptr) ptr = ptr->next; delete ptr; O ptr = last; delete ptr; list->next->next = nullptr; delete ptr; O None of these
Expert Solution
trending now

Trending now

This is a popular 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.
Similar 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