C Program To Implement Stack using Linked List Data Structure
Learn How To Implement Stack using Linked List in C Programming Language. Stack data structure can be implemented using Arrays as well. We have demonstrated the code for most of the operations in a Stack Data Structure such as Deletion, Insertion, Displaying all the Elements of the Stack and the Peek Function.
Must Read: C Program To Implement Stack using Array
To understand this Stack using Linked List C program effectively, you must be well versed with the concept of Linked List and Stacks Implementation using Static Arrays. The Stack Linked List C program makes use of Pointers, Structures and Functions.
What is a Stack Data Structure?
A Stack is a Linear Data Structure used to store elements in it. It works on the Last In First Out (LIFO) principle. The element or the data is inserted from a single end often referred as a TOP Pointer. The different operations applied on a Stack are Insertion, Deletion, Displaying Elements and Peek methods.
The Push method represents insertion of an Element whereas the Pop method method is used to remove or delete an element from the Stack. The Peek method is used to see the element at the TOP pointer.
Real World Application of Stack Data Structure
- Conversion of an Infix Expression To Postfix Expression
- CPU Scheduling Algorithms
- Evaluation of an Expression or Mathematical Expression
Must Read: C Program For Linked List Implementation
C Program For Stack using Linked List with Functions
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 | #include<stdio.h> #include<stdlib.h> struct node { int data; struct node *link; }*top = NULL; int isEmpty() { if(top == NULL) { return 1; } else { return 0; } } void push(int item) { struct node *temp; temp = (struct node *)malloc(sizeof(struct node)); if(temp == NULL) { printf("Stack is Full\n"); return; } temp->data = item; temp->link = top; top = temp; } int delete_node() { struct node *temp; int item; if(isEmpty()) { printf("Stack is Empty\n"); exit(1); } temp = top; item = temp->data; top = top->link; free(temp); return item; } void display() { struct node *ptr; if(isEmpty()) { printf("Stack is Empty\n"); return; } printf("Stack Elements:\n\n"); for(ptr = top; ptr != NULL; ptr = ptr->link) { printf(" %d\n", ptr->data); } printf("\n"); } int peek() { if(isEmpty()) { printf("Stack is Empty\n"); exit(1); } return top->data; } int main() { int option, element; while(1) { printf("1. Push an Element on the Stack\n"); printf("2. delete_node or Delete an Element from the Stack\n"); printf("3. Display Top-most item of the Stack\n"); printf("4. Display All Element of the Stack\n"); printf("5. Exit\n"); printf("Enter your Option:\t"); scanf("%d", &option); switch(option) { case 1: printf("Enter the item to be Pushed on the Stack:\t"); scanf("%d", &element); push(element); break; case 2: element = delete_node(); printf("Deleted Element:\t%d\n", element); break; case 3: printf("Element at the Top of Stack:\t%d\n", peek()); break; case 4: display(); break; case 5: exit(1); default: printf("Wrong Option Selected\n"); } } return 0; } |
Must Read: Queue Implementation using Linked List in C Programming
Output
In case you get any Compilation Errors or any doubts in this C Program for Stack using Linked List Data Structure in C Programming with Structure, Pointer and Function, let us know about it in the Comment Section below. Find more information about Stack Data Structure here.
Is this Stack Program using Linked List using Singly Linked List or Doubly Linked List?
This C Program is for Stack Implementation using Singly Linked Lists.
thank you for the queue and stack using linked list program in c language.