Program to implement a Dynamic/Linked Stack using Linked List

Program:

#include <stdio.h>
#include <stdlib.h>
struct student
{
    int rollno;
    char name[20];
    float fee;
    struct student *next;
};
struct student *top = NULL;
void push()
{
    struct student *newstudent = (struct student *)malloc(sizeof(struct student));
    if (newstudent == NULL)
        printf("Overflow: Memory Full. You cant insert more items\n");
    else
    {
        printf("\nenter student roll no: ");
        scanf("%d", &newstudent->rollno);
        printf("enter name: ");
        fflush(stdin);
        gets(newstudent->name);
        printf("enter fee : ");
        scanf("%f", &newstudent->fee);
        newstudent->next = top;
        top = newstudent;
    }
}
void pop()
{
    if (top == NULL)
        printf("underflow!!!. Stack is empty. No item to delete");
    else
    {
        struct student *ptr = top;
        printf("Deleted item is :\n");
        printf("Rollno\tname\tfee");
        printf("\n%d\t%s\t%f\n", top->rollno, top->name, top->fee);
        free(ptr);
        top = top->next;
    }
}
void peek()
{
    if (top == NULL)
        printf("Stack is empty. No item to display");
    else
    {
        printf("Item at the Top is :\n");
        printf("Rollno\tname\tfee");
        printf("\n%d\t%s\t%f\n", top->rollno, top->name, top->fee);
    }
}
void display()
{
    if (top == NULL)
        printf("Stack is empty. No item to display");
    else
    {
        struct student *ptr = top;
        printf("\nInformation of stack is : \n");
        printf("Rollno\tname\tfee");
        while (ptr != NULL)
        {
            printf("\n%d\t%s\t%f\n", ptr->rollno, ptr->name, ptr->fee);
            ptr=ptr->next;
        }
    }
}
void main()
{
    int ch;
    printf("****************************************\n");
    printf("****************************************\n");
    printf("**       Dynamic / Linked stack       **\n");
    printf("**         Using Linked Lists         **\n");
    printf("**   Program Created By Sheetal Garg  **\n");
    printf("**         Assistant professor        **\n");
    printf("**               9467863365           **\n");
    printf("****************************************\n");
    printf("****************************************\n");
    while (1)
    {
        printf("\nOptions Available are\n");
        printf("1. Push \n");
        printf("2. Pop \n");
        printf("3. Peek \n");
        printf("4. Display \n");
        printf("5. Exit \n");
        printf("\nEnter your choice : ");
        scanf("%d", &ch);
        switch (ch)
        {
        case 1:
            push();
            break;
        case 2:
            pop();
            break;
        case 3:
            peek();
            break;
        case 4:
            display();
            break;
        case 5:
            exit(0);
        default:
            printf("Wrong choice entered");
        }
    }
}

Output:

****************************************
****************************************
**       Dynamic / Linked stack       **
**         Using Linked Lists         **
**   Program Created By Sheetal Garg  **
**         Assistant professor        **
**               9467863365           **
****************************************
****************************************

Options Available are
1. Push 
2. Pop 
3. Peek 
4. Display 
5. Exit 

Enter your choice :
1

enter student roll no: 1
enter name: Sheetal
enter fee : 15000 

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 1

enter student roll no: 2 
enter name: Amit
enter fee : 20000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 1

enter student roll no: 3
enter name: Nidhi
enter fee : 25000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 4

Information of stack is :
Rollno  name    fee
3       Nidhi   25000.000000

2       Amit    20000.000000

1       Sheetal 15000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 3
Item at the Top is :
Rollno  name    fee
3       Nidhi   25000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 2
Deleted item is :
Rollno  name    fee
3       Nidhi   25000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 4

Information of stack is :
Rollno  name    fee
2       Amit    20000.000000

1       Sheetal 15000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 2
Deleted item is :
Rollno  name    fee
2       Amit    20000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 4

Information of stack is :
Rollno  name    fee
1       Sheetal 15000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 2
Deleted item is :
Rollno  name    fee
1       Sheetal 15000.000000

Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 4
Stack is empty. No item to display
Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 2
underflow!!!. Stack is empty. No item to delete
Options Available are
1. Push
2. Pop
3. Peek
4. Display
5. Exit

Enter your choice : 5
error: You can only copy the programs code and output from this website. You are not allowed to copy anything else.