Write a program using linked list (not STL List) and mimic the stack push and pop operations in list's insert and delete functions. If you don't know about stack, stack follows Last In First Out (LIFO) pattern. Any item inserted in the stack first can be removed at last. Your linked list's insert and delete functions should insert the nodes in the linked list in such a way that the last inserted item could be remove and first element could be removed last. For insertion, a node must be inserted from back end (not at head or middle) You can use the following structure for the node or any other of your choice. struct Node int data; Node * next; Note: Write constructors (if applicable), use menu to offer choice to the user such as insert, delete, display, size and exit.
Addition of Two Numbers
Adding two numbers in programming is essentially the same as adding two numbers in general arithmetic. A significant difference is that in programming, you need to pay attention to the data type of the variable that will hold the sum of two numbers.
C++
C++ is a general-purpose hybrid language, which supports both OOPs and procedural language designed and developed by Bjarne Stroustrup. It began in 1979 as “C with Classes” at Bell Labs and first appeared in the year 1985 as C++. It is the superset of C programming language, because it uses most of the C code syntax. Due to its hybrid functionality, it used to develop embedded systems, operating systems, web browser, GUI and video games.
please use c++ to answer the following question
![Write a program using linked list (not STL List) and mimic the stack push and pop operations in list's insert and delete functions.
If you don't know about stack, stack follows Last In First Out (LIFO) pattern. Any item inserted in the stack first can be removed at last.
Your linked list's insert and delete functions should insert the nodes in the linked list in such a way that the last inserted item could be removed fir
and first element could be removed last. For insertion, a node must be inserted from back end (not at head or middle)
You can use the following structure for the node or any other of your choice.
struct Node
int data;
Node * next;
Note: Write constructors (if applicable), use menu to offer choice to the user such as insert, delete, display, size and exit.
For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F902b1693-09a9-4849-a7f5-ed5b828f0e76%2Fd419e965-fe13-4b92-8fe3-376480b6895c%2F2gno2ug_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)