/* A Simple Stack Implementation in C++ using a Singly-Linked-List What to provide as Input - This is a menu-driven program, abd thus requires input after each operation. Thus it is suggested that one runs it in CppDroid. But still, if you want to use it here, here is the syntax for input: 1) Enter the choice, 1(create), 2(add), 3(remove), 4(display). 2) If you entered 1, you will be redirected to the creation loop. There you have to enter any element value, and then Y/N in a new line, to add more or stop respectively. 3) If you pressed 2 at menu, just enter the new value (Though this requires an existing list, and so, 1 must be used before). 4) If you pressed 3, you need not press anything else, as if the list exists, the last element will be deleted. 5) Pressing 5 would display the list. 5) So, a simple input would look like : 1 // Create 1 // Add 1 Y // Continue 2 // Add 2 Y // Continue 3 // Add 3 N // Stop 2 // Add more 4 // 4 added 3 // Delete 4 4 // Print Explanation - This will create a new list and add 1,2 and 3 to it, then add a new elm 4 and then delete it, and finally print the list. */ #include #include using namespace std; typedef int type; ///Change this to any type before compilation to implement the linked list for custom types struct Node /// The Node Structure - for the list's elements. { type data; Node* next; }; Node* start; /// First Element of your List. Node* Init(type val) ///Initiate a new node , just for assigning values. { Node* ptr = new Node; ptr->data = val; ptr->next = nullptr; return ptr; } void Push(Node*& dest, Node* source) /// Push a node into your List. (As in a Stack) { if(dest == NULL) dest = source; else { Node* temp = dest; dest = source; source->next = temp; } } void Pop(Node*& dest) /// Pop the last node from your list (As in a Stack) { if(dest != NULL) start = start->next; } void Print(Node*& dest) /// Display the list as it is now. { if(dest == NULL) { cout<<"NULL"<data<<" -> "; tmp = tmp->next; } while ( tmp != NULL ); cout << "NULL" << endl; } int main() { cout<<"\t\t\t\tLinked-List Menu"<>opt; switch(opt) { case 1: type val; cout<>val; Node* newp = Init(val); Push(start,newp); cout<<"Continue ? - ";char k;cin>>k; if(k!='Y'&&k!='y') break; } created = true; break; case 2: cout<>val; Node* newp = Init(val); Push(start,newp); } else cout<<"No List Exists!"<

Stacks using Singly-Linked-Lists