. 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 a function to check if an element is contained in the list 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 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 Pitfal last element in the list or printing an empty list. Consider other test cases Stac for checking the full functionality of your doubly linked list. Ensure that Pitfal both your doubly linked list class and your Node class carefully handle dynamic memory and do not leak memory.

A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner a…

When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely differe…