link_list_stack.cpp

#include<iostream>
using namespace std;
struct node
{
    int data;
    node* link;
};
typedef node* NODE;
NODE get_node()
{
    NODE x;
    x=new node;
    if(x==NULL)
        cout<<"Memory Full";
    return x;
}
NODE insert_front(NODE &root, int item,int &n)
{
    NODE temp;
    temp=get_node();
    temp->data=item;
    temp->link=root;
    n++;
    return temp;
}
NODE delete_front(NODE &root,int &n)
{
    NODE temp;
    if(root==NULL)
    {
        cout<<"Stack Empty";
        return root;
    }
    else if(root->link==NULL)
    {
        cout<<"Element Removed : "<<root->data;
        delete root;
        root=NULL;
        n--;
        return root;
    }
    temp=root;
    cout<<"Element Removed : "<<temp->data;
    delete temp;
    root=root->link;
    n--;
    return root;
}
void display(NODE root,int &n)
{
    NODE temp=root;
    if(root==NULL)
    {
        cout<<"\nStack Empty";
        return;
    }
    while(temp!=NULL)
    {
        cout<<temp->data<<"->";
        temp=temp->link;
    }
    cout<<"\nTotal:"<<n;
}
int main()
{
    NODE root=NULL;
    int ch,n=1,x,nodes=0;
    cout<<"Enter choice";
    while(n==1)
    {
        cout<<"\n1.Push"<<endl;
        cout<<"2.Pop"<<endl;
        cout<<"3.Display"<<endl;
        cout<<"4.Exit"<<endl;
        cin>>ch;
        switch(ch)
        {
        case 1:
            cout<<"\nEnter the element to enter : ";
            cin>>x;
            root=insert_front(root,x,nodes);
            break;
        case 2:
            root=delete_front(root,nodes);
            break;
        case 3:
            cout<<"\nStack:  ";
            display(root,nodes);
            break;
        case 4:
            n=0;
            break;
        default:
            cout<<"\nWrong Input.";
            break;
        }
    }
    return 0;
}