Short Review of Stack

STACK?
Useful data
structure in
programming
1 Pile of plates
kept on top
of each other
2

• Put a new plate on top
Last In First Out
• Remove the top plate

void main()
{
int choice, value;
printf("n:: Stack using Linked List ::n");
while(1)
{
printf("n****** MENU ******n");
printf("1. Pushn2. Popn3. Displayn4. Exitn");
printf("Enter your choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("Enter the value to be insert: ");
scanf("%d", &value);
push(value);
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
exit(0);
default:
printf("nWrong selection!!! Please try again!!!n");
}
}
}
Stack in Code
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
struct Node
{
int data;
struct Node *next;
}*top = NULL;
void push(int);
void pop();
void display();

void push(int value)
{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
if(top == NULL)
newNode->next = NULL;
else
newNode->next = top;
top = newNode;
printf("nInsertion is Success!!!n");
}

void pop()
{
if(top == NULL)
printf("nStack is Empty!!!n");
else{
struct Node *temp = top;
printf("nDeleted element: %d", temp->data);
top = temp->next;
free(temp);
}
}

void display()
{
if(top == NULL)
printf("nStack is Empty!!!n");
else{
struct Node *temp = top;
while(temp->next != NULL){
printf("%d--->",temp->data);
temp = temp -> next;
}
printf("%d--->NULL",temp->data);
}
}

Short Review of Stack

More Related Content

What's hot (20)

Similar to Short Review of Stack (20)

More from Owali Shawon (10)

Recently uploaded (20)

Short Review of Stack