Implement Stack Using Linked List

/* C++ Program to Implement Stack Using Linked List */
#include<bits/stdc++.h>
using namespace std;

/* Structrue of the Node */
struct node
{
    int data;
    struct node *next;
};


/* Function to Push an element in a stack */
void push(struct node **head, int ele)
{
    /*Creating a new node.*/
    struct node *new_node;
    new_node = (struct node*)malloc(sizeof(struct node));
    new_node->data = ele;
    new_node->next = NULL;
    
    cout<<ele<<" is pushed into stack!!\n";
    
    /* check whether the Stack is empty or not*/
    /* If empty, new node will become head of the stack(Linked List) */
    if(*head == NULL)     
    {
        *head = new_node;
        return;
    }
    
    /* If stack is not empty, insert element at beginning of stack */
    new_node -> next = *head;
    (*head) = new_node;
    
}

/* Function to Pop out element from stack*/
void pop(struct node **head)
{
    /* If Stack is NULL, simply return */
    if(*head == NULL)
    {
        cout<<"Stack is already empty!!";
        return;
    }

    /* Delete the top element and assign head to next of current head */
    struct node *temp = *head;
    cout<<temp->data<<" is popped out from stack!!\n";
    (*head) = (*head) -> next;
    delete temp;
}

/* Function to Peek in a Stack */
void peek(struct node *head)
{
    /* If Stack is empty, return */
    if(head == NULL)
    {
        cout<<"\nStack is Empty!!\n\n";
        return;
    }
    /* If stack is not empty, print the top element */
    cout<<"\nThe top Element of Stack is "<<head->data<<"\n\n";
}
int main()
{
    struct node *head;
    head = NULL;
    cout<<"Inserting 3 Elements in a Stack!!\n\n";
    push(&head,1);
    push(&head,2);
    peek(head);
    push(&head,3);
    cout<<"\n\n Popping Elements from the stack!!\n\n";
    pop(&head);
    pop(&head);
    peek(head);
    pop(&head);
    pop(&head);

}