Program Plan: In the program, we include the header files as needed. The structure is declared to move from one node to another node. Function prototype will be declared. link_create(): The following function is to take a new node at the beginning of the list. link_display(): The following function will display the data inserted into the linked list. link_insert(): The following function will insert data anywhere in the linked list. link_del(): The following function will delete the data from the linked list. Declaring main() function as integer type. The user will insert the input. Required functions will be called here to convert the infix to postfix arithmetic expression. Program Description: This program creates a linked list program which allows insertion and deletion at any anywhere in the list. Program: //declaring the header files as required. #include <iostream> #include <conio.h> #include <stdlib.h> usingnamespacestd; //structure of link list is declared. struct node{ intthe_data; node*prev_node,*next_node; }*qr,*tempr,*li_start=NULL; int c1, c2 ; // declaring the function prototype. voidlink_create(); voidlink_display(); voidlink_insert(); voidlink_del(); //starting of main() function. int main() {//while loop will run until we finish with link list. while(1) { cout<<" \t\t &***** INSERTION AND DELETION IN LINKED LIST ******\n"; cout<<" Press 1 for adding data \n"; cout<<" Press 2 for displaying data \n "; cout<<" Press 3 for insertion \n "; cout<<" Press 4 for deletion \n "; cout<<" Press 0 for exit\n "; charch; ch=getch(); switch(ch) { case'1': link_create(); break; case'2': link_display(); getch(); break; case'3': link_insert(); break; case'4': link_del(); break; case'0': exit(1); } } } // function to insert new data to link list . voidlink_create() { tempr=new node; tempr->next_node=NULL; cout<<"\nEnter the data\n "; cin>>tempr->the_data; if(li_start==NULL) { li_start=tempr; tempr->prev_node=NULL; } else { qr=li_start; while(qr->next_node!=NULL) { qr=qr->next_node; } qr->next_node=tempr; tempr->prev_node=qr; } } // function to display the list which is created. voidlink_display() { qr=li_start; while(qr!=NULL) { cout<<qr->the_data<<endl; qr=qr->next_node; } } // function to insert data to link list at any position. voidlink_insert() { cout<<"Press 1 to insert at begining: \n "; cout<<"Press 2 to insert at middle\n "; cout<<"Press 3 to insert at end\n "; intur_choice; cin>>ur_choice; switch(ur_choice) { case1: tempr=new node; cout<<"Enter the data \n"; cin>>tempr->the_data; li_start->prev_node=tempr; tempr->next_node=li_start; li_start=tempr; tempr->prev_node=NULL; break; case2: cout<<"Enter the data aftre which you want to add new data\n"; intur_ch; cin>>ur_ch; qr=li_start; while(qr->next_node!=NULL) { if(qr->the_data==ur_ch) { tempr=new node; cout<<"Enter the data \n"; cin>>tempr->the_data; qr->next_node->prev_node=tempr; tempr->next_node=qr->next_node; tempr->prev_node=qr; qr->next_node=tempr; } qr=qr->next_node; } break; case3: tempr=new node; cout<<"Enter the data\n"; cin>>tempr->the_data; tempr->next_node=NULL; qr=li_start; while(qr->next_node!=NULL) { qr=qr->next_node; } qr->next_node=tempr; tempr->prev_node=NULL; } } //function to delete data from link list. voidlink_del() { cout<<"Enter the data you want to delete \n"; intur_num; cin>>ur_num; qr=li_start; if(li_start->the_data==ur_num) li_start=li_start->next_node; else { while(qr!=NULL) { if(qr->next_node->the_data==ur_num) { tempr=qr->next_node; qr->next_node=tempr->next_node; tempr->next_node->prev_node=qr; deletetempr; } qr=qr->next_node; } } } Sample Output: ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit Enter the data 12 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit Enter the data 15 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit Enter the data 20 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit 12 15 20 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit Enter the data you want to delete 12 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit 15 20 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit Press 1 to insert at beginning: Press 2 to insert at middle Press 3 to insert at end 1 Enter the data 35 ******* INSERTION AND DELETION IN LINKED LIST ****** Press 1 for adding data Press 2 for displaying data Press 3 for insertion Press 4 for deletion Press 0 for exit 35 15 20

C++ How to Program (10th Edition)

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

See similar textbooks

Concept explainers

Concept of Pointer Parameter

Pointers are the special variable that stores the variable address, instead of storing the variable value. Pointer is a powerful feature of a programming language. A pointer is mostly used to save memory space and improve execution time.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 19, Problem 19.24E

Chapter 19, Problem 19.26E

Students have asked these similar questions

C++ programming design a class to implement a sorted circular linked list. The usual operations on a circular list are:Initialize the list (to an empty state). Determine if the list is empty. Destroy the list. Print the list. Find the length of the list. Search the list for a given item. Insert an item in the list. Delete an item from the list. Copy the list. Write the definitions of the class circularLinkedList and its member functions (You may assume that the elements of the circular linked list are in ascending order). Also, write a program to test the operations of your circularLinkedList class. NOTE: The nodes for your list can be defined in either a struct or class. Each node shall store int values.

Please be thorough with explanation (a) Consider implementing a stack as a class that relies on a singly linked list, maintaining pointers to both the start and end of the singly linked list in the main object. You consider two possibilities. The first is to push (insert) to the beginning and pop (remove) from the beginning of the linked list. The second is to push to the end and pop from the end of the linked list. Is one of these possibilities better than the other? Briefly explain your answer.

QUESTION: NOTE: This assignment is needed to be done in OOP(c++/java), the assignment is a part of course named data structures and algorithm. A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items. Now in the main do the following Insert Items in list Display all items. Traverse…

Knowledge Booster

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.

Solution Summary: The author describes how the program creates a linked list program which allows insertion and deletion at any anywhere in the list.

Concept explainers

Want to see the full answer?

Chapter 19 Solutions