Scribd
Upload
8 views4 pages

Ds Experiment 10

Uploaded by

AK Sing
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views4 pages

Ds Experiment 10

Uploaded by

AK Sing
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Experiment no.

10

Aim: Write programs to implement stack using the linked list data
structures
/**
* Stack implementation using linked list
*/

#include <stdio.h>
#include <stdlib.h>
#include <limits.h> // For INT_MIN

#define CAPACITY 100 // Stack maximum capacity

// Define stack node structure


struct stack
{
int data;
struct stack *next;
} *top;

// Stack size
int size = 0;

/* Function declaration to perform push and pop on stack */


void push(int element);
int pop();

void main()
{
int choice, data;

while(1)
{
/* Menu */
printf("------------------------------------\n");
printf(" STACK IMPLEMENTATION PROGRAM \n");
printf("------------------------------------\n");
printf("1. Push\n");
printf("2. Pop\n");
printf("3. Size\n");
printf("4. Exit\n");
printf("------------------------------------\n");
printf("Enter your choice: ");

scanf("%d", &choice);
switch(choice)
{
case 1:
printf("Enter data to push into stack: ");
scanf("%d", &data);

// Push element to stack


push(data);
break;

case 2:
data = pop();

// If stack is not empty


if (data != INT_MIN)
printf("Data => %d\n", data);
break;

case 3:
printf("Stack size: %d\n", size);
break;

case 4:
printf("Exiting from app.\n");
exit(1);
break;

default:
printf("Invalid choice, please try again.\n");
}

printf("\n\n");
}

/**
* Functiont to push a new element in stack.
*/
void push(int element)
{
// Create a new node and push to stack
struct stack * newNode = (struct stack *) malloc(sizeof(struct
stack));
// Check stack overflow
if (size >= CAPACITY)
{
printf("Stack Overflow, can't add more element to stack.\n");
return;
}
// Assign data to new node in stack
newNode->data = element;

// Next element after new node should be current top element


newNode->next = top;

// Make sure new node is always at top


top = newNode;

// Increase element count in stack


size++;

printf("Data pushed to stack.\n");


}

/**
* Function to pop element from top of stack.
*/
int pop()
{
int data = 0;
struct stack * topNode;

// Check stack underflow


if (size <= 0 || !top)
{
printf("Stack is empty.\n");

// Throw empty stack error/exception


// Since C does not have concept of exception
// Hence return minimum integer value as error value
// Later in code check if return value is INT_MIN, then
// stack is empty
return INT_MIN;
}

// Copy reference of stack top to some temp variable


// Since we need to delete current stack top and make
// Stack top its next element
topNode = top;

// Copy data from stack's top element


data = top->data;

// Move top to its next element


top = top->next;

// Delete the previous top most stack element from memory


free(topNode);
// Decrement stack size
size--;

return data;
}

You might also like