11. Write a doubly linked list class to store double values in Node objects. Include the following functionality: functions for inserting at the front and rear functions for returning the first and last element value functions for printing out the list, in both forward and reverse order functions for removing the first element and the last element

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

can you help me with no.11 in c++? thanks

 

Include the following functionality:
Programming Projects
11. Write a doubly linked list class to store double values in Node objects.
functions for inserting at the front and rear
functions for returning the first and last element value
functions for printing out the list, in both forward and reverse order
functions for removing the first element and the last element
a function to check if an element is contained in the lis
a function to empty the entire list
a function to check if the list is empty
a function to return the size of the list
THINKING RECURS
IVE
CLY
643
Test your class by adding elements at both the front and the rear, printing
the list in both forward and reverse order and by removing elements. There
are many possible edge cases that you should check, such as deleting the
last element in the list or printing an empty list. Consider other test cases
for checking the full functionality of your doubly linked list. Ensure that
both your doubly linked list class and your Node class carefully handle
dynamic memory and do not leak memory.
Transcribed Image Text:Include the following functionality: Programming Projects 11. Write a doubly linked list class to store double values in Node objects. functions for inserting at the front and rear functions for returning the first and last element value functions for printing out the list, in both forward and reverse order functions for removing the first element and the last element a function to check if an element is contained in the lis a function to empty the entire list a function to check if the list is empty a function to return the size of the list THINKING RECURS IVE CLY 643 Test your class by adding elements at both the front and the rear, printing the list in both forward and reverse order and by removing elements. There are many possible edge cases that you should check, such as deleting the last element in the list or printing an empty list. Consider other test cases for checking the full functionality of your doubly linked list. Ensure that both your doubly linked list class and your Node class carefully handle dynamic memory and do not leak memory.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY