Scribd
Upload
6 views3 pages

Stack Implementation with Linked List

This C program implements a stack using a linked list. It includes functions for creating nodes, inserting and deleting elements, checking if the stack is empty, pushing and popping elements, and printing the stack. The main function demonstrates the stack operations by pushing and popping elements and printing the stack's state.

Uploaded by

dakshvaghasia503
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
6 views3 pages

Stack Implementation with Linked List

This C program implements a stack using a linked list. It includes functions for creating nodes, inserting and deleting elements, checking if the stack is empty, pushing and popping elements, and printing the stack. The main function demonstrates the stack operations by pushing and popping elements and printing the stack's state.

Uploaded by

dakshvaghasia503
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

// C program to implement a stack using linked list

#include <stdio.h>
#include <stdlib.h>

// ________LINKED LIST UTILITY FUNCITON____________

// Define the structure for a node of the linked list


typedef struct Node {
int data;
struct Node* next;
} node;

// linked list utility function


node* createNode(int data)
{
// allocating memory
node* newNode = (node*)malloc(sizeof(node));

// if memory allocation is failed


if (newNode == NULL)
return NULL;

// putting data in the node


newNode->data = data;
newNode->next = NULL;
return newNode;
}

// fuction to insert data before the head node


int insertBeforeHead(node** head, int data)
{
// creating new node
node* newNode = createNode(data);
// if malloc fail, return error code
if (!newNode)
return -1;

// if the linked list is empty


if (*head == NULL) {
*head = newNode;
return 0;
}

newNode->next = *head;
*head = newNode;
return 0;
}
// deleting head node
int deleteHead(node** head)
{
// no need to check for empty stack as it is already
// being checked in the caller function
node* temp = *head;
*head = (*head)->next;
free(temp);
return 0;
}

// _________STACK IMPLEMENTATION STARTS HERE_________

// Function to check if the stack is empty or not


int isEmpty(node** stack) { return *stack == NULL; }

// Function to push elements to the stack


void push(node** stack, int data)
{
// inserting the data at the beginning of the linked
// list stack
// if the insertion function returns the non - zero
// value, it is the case of stack overflow
if (insertBeforeHead(stack, data)) {
printf("Stack Overflow!\n");
}
}

// Function to pop an element from the stack


int pop(node** stack)
{
// checking underflow condition
if (isEmpty(stack)) {
printf("Stack Underflow\n");
return -1;
}

// deleting the head.


deleteHead(stack);
}

// Function to return the topmost element of the stack


int peek(node** stack)
{
// check for empty stack
if (!isEmpty(stack))
return (*stack)->data;
else
return -1;
}

// Function to print the Stack


void printStack(node** stack)
{
node* temp = *stack;
while (temp != NULL) {
printf("%d-> ", temp->data);
temp = temp->next;
}
printf("\n");
}

// driver code
int main()
{
// Initialize a new stack top pointer
node* stack = NULL;

// Push elements into the stack


push(&stack, 10);
push(&stack, 20);
push(&stack, 30);
push(&stack, 40);
push(&stack, 50);

// Print the stack


printf("Stack: ");
printStack(&stack);
// Pop elements from the stack
pop(&stack);
pop(&stack);
// Print the stack after deletion of elements
printf("\nStack: ");
printStack(&stack);

return 0;
}

You might also like