Scribd
Upload
37 views

Struct Int Struct: #Include #Include

This C code implements a stack using a linked list data structure. It defines a Node struct with a data field and next pointer. Functions are defined to push values onto the stack by adding nodes to the head, pop values off by removing the head node, and display the stack by traversing from head to tail. The main function provides a menu to test the stack operations and loops until exit is chosen to free all allocated nodes.

Uploaded by

Overloaded Sense
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views

Struct Int Struct: #Include #Include

This C code implements a stack using a linked list data structure. It defines a Node struct with a data field and next pointer. Functions are defined to push values onto the stack by adding nodes to the head, pop values off by removing the head node, and display the stack by traversing from head to tail. The main function provides a menu to test the stack operations and loops until exit is chosen to free all allocated nodes.

Uploaded by

Overloaded Sense
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <stdio.

h>
#include <stdlib.h>
struct Node
{
int Data;
struct Node *next;
}*top;
void popStack()
{
struct Node *temp, *var=top;
if(var==top)
{
top = top->next;
free(var);
}
else
printf("\nStack Empty");
}
void push(int value)
{
struct Node *temp;
temp=(struct Node *)malloc(sizeof(struct Node));
temp->Data=value;
if (top == NULL)
{
top=temp;
top->next=NULL;
}
else
{
temp->next=top;
top=temp;
}
}
void display()
{
struct Node *var=top;
if(var!=NULL)
{
printf("\nElements are as:\n");
while(var!=NULL)
{
printf("\t%d\n",var->Data);
var=var->next;

}
printf("\n");
}
else
printf("\nStack is Empty");

int main(int argc, char *argv[])


{
int i=0;
top=NULL;
printf(" \n1. Push to stack");
printf(" \n2. Pop from Stack");
printf(" \n3. Display data of Stack");
printf(" \n4. Exit\n");
while(1)
{
printf(" \nChoose Option: ");
scanf("%d",&i);
switch(i)
{
case 1:
{
int value;
printf("\nEnter a valueber to push into Stack: ");
scanf("%d",&value);
push(value);
display();
break;
}
case 2:
{
popStack();
display();
break;
}
case 3:
{
display();
break;
}
case 4:
{
struct Node *temp;
while(top!=NULL)
{
temp = top->next;

free(top);
top=temp;

}
exit(0);
}
default:
{
printf("\nwrong choice for operation");
}
}

Output of Stack using linked list in c code:

Stack using linked list in c

You might also like