Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

bartleby

Concept explainers

Question

example:
"apple->orange->banana->pear"->NULL
return "orange"

Thanks!

LinkedLongest
Editor
1 string longest(node* head)
ill in code here
Problem Statement
4
This problem provides you with a linked list composed of node objects
chained together via node pointers. Each node has a next pointer which
points to the next node in the chain. The last node is identified by having
a NULL (or nullptr) next pointer.
The linked lists for this problem store string data. Your task is simple
identify the longest string stored in the linked list. If two strings are of the
same length, return the string that occurred earlier in the linked list. If
the linked list is empty, return the empty string
Create a function longest, which takes in a pointer to the head of the
linked list, and returns the longest string in the linked list
The linked lists for this problem use the following class declaration (this is
already available to the autograder code; do not copy this into your
solution)
class node
public:
string data;
node* next;
J:
Notes and Constraints
. The linked list starting at head contains between 0 and 10 nodes,
inclusive
Test
Submit
expand button
Transcribed Image Text:LinkedLongest Editor 1 string longest(node* head) ill in code here Problem Statement 4 This problem provides you with a linked list composed of node objects chained together via node pointers. Each node has a next pointer which points to the next node in the chain. The last node is identified by having a NULL (or nullptr) next pointer. The linked lists for this problem store string data. Your task is simple identify the longest string stored in the linked list. If two strings are of the same length, return the string that occurred earlier in the linked list. If the linked list is empty, return the empty string Create a function longest, which takes in a pointer to the head of the linked list, and returns the longest string in the linked list The linked lists for this problem use the following class declaration (this is already available to the autograder code; do not copy this into your solution) class node public: string data; node* next; J: Notes and Constraints . The linked list starting at head contains between 0 and 10 nodes, inclusive Test Submit
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Computer Science
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
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education