Please do not give solution in image format thanku
Write a complete C++ program for practicing a Doubly Linked List (DLL) Data Structure Operations.
Doubly Linked List:
1. Insert into the DLL at (head, middle, end).
2. Display the DLL elements (Forward and Backward).
3. Sort the DDL elements (Ascending and Descending).
4. Delete from the (head, middle, end) of the DLL.
5. Search for an element in DLL.
6. Reverse a word using a char DDL.
7. Split an integer DDL into two DLLs: an even DDL and an odd DLL.
8. Exit.
----------------------------------------------------------------------------------------------
Main Menu
1- ...
2- …
3- …
8. Exit
------------------------------------------------------------------------------------
Please enter the number of the required operation (1-7) from the above menu: X
Please enter xxx: xxxx
Operation executed successfully.
Please enter the number of the required operation (1-N) from the above menu: X
Step by stepSolved in 3 steps with 1 images
- What are the fundamental similarities and differences between arrays and lists? Please include examples.arrow_forwardIn Python: Create a function Matrix_transpose() utilizing List comprehension techniques that takes a 2d list containing user generated/input elements of type int as its argument then returns the reference to a new 2d list that is the transpose of the original. Assume the matrix is rectangular. Show the funtion works with different values. Do not use any python packages to create the funtion.arrow_forwardWhat are the key structural differences between arrays and linked lists?arrow_forward
- Which of the following statements regarding linked lists and arrays is correct? Group of answer choices: a. A dynamically resizable array makes insertions at the beginning of an array very efficient. b. Using a doubly linked list is more efficient than an array when accessing the ith element of a structure. c. A dynamically resizable array is another name for a linked list. d. Any type of list tends to be better than an array when there are a set number of maximum items known beforehand. e. If many deletions at any place in the structure were common, a linked list implementation would likely be preferable to an arrayarrow_forwardDSarrow_forward