2. Dynamically:-<\/strong> You can also implement a stack using a linked list. It allows dynamic memory allocation of its data elements. In this, the stack takes over the characteristics of the linked list.<\/p>\n In C, you can implement the stack using an array. And arrays support static memory allocation of its data elements. Before running the program code, you have to declare the size of the array in advance.<\/p>\n The operation for inserting a value into the stack is known as push. If you push something to the stack, it will be added at the top of the stack.<\/p>\n Example of Inserting elements to the stack<\/strong><\/p>\n The operation for deleting a value from the stack is known as pop. In stack, you can only delete an element from the top of the stack.<\/p>\n Example of Deleting an element from the stack using C<\/strong><\/p>\n Stack follows the Last-In-Fast-Out rule. And the data elements of the stack are displayed according to it.<\/p>\n Example of Displaying the elements of the stack<\/strong><\/p>\n If the size of the array is exceeding its limit, then stack overflow occurs. If the stack is completely filled with the elements, you cannot insert any element into the stack. Still if you do then you will face stack overflow. Arrays support static memory allocation of its data elements.<\/p>\n If you are displaying the elements of a stack or performing the deletion operation on a stack but the stack is empty then this situation is called Stack Underflow.<\/p>\n Example of Array Implementation of Stack in C<\/strong><\/p>\n Output:-<\/strong><\/p>\n Enter your choice from the above: 1 Enter your choice from the above: 1 Enter your choice from the above: 2 Enter your choice from the above: 3 Enter your choice from the above: 4<\/p>\n<\/div>\n Linked Lists provide dynamic memory allocation of its data elements. In this method, you do not have to declare the size of the stack in advance. You can perform the basic three operations on it such as Insertion, Deletion and Display.<\/p>\n You can insert an element into the stack through a linked list.<\/p>\n Example of Inserting an element into the stack<\/strong><\/p>\n You can also delete an element from the stack.<\/p>\n Example of Deleting an element from the stack<\/strong><\/p>\n If you want to display the elements of the stack then follow the below code.<\/p>\n Example of Stack Implementation using Linked Lists<\/strong><\/p>\n Output:-<\/strong><\/p>\n Please enter your choice from the above: 1 Please enter your choice from the above: 1 Please enter your choice from the above: 2 1. Number Reversing:-<\/strong> You can easily reverse a sequence of characters or digits.<\/p>\n 2. Undo Operation:-<\/strong> In text editors, you can see an undo operation. If you click it then all the changes you made will go back to normal. All the changes are stored into the stack.<\/p>\n 3. Infix to Postfix Conversion: With the help of stacks, you can convert<\/strong>\u00a0from infix to postfix.<\/p>\n 4. Backtracking:-<\/strong> You can use stacks to solve various maze puzzling problems.<\/p>\n 5. Depth First Search:<\/strong>– With the help of stacks, you can perform a searching algorithm named Depth-First Search.<\/p>\n Queue is known as a linear data structure. It follows the First-In-First-Out rule. So, if you push something to the stack then the first value of the stack will pop out. In the queue, the insertion operation is done from the rear end(back) and the deletion is done from the front.<\/p>\n In 2 ways, you can implement the queue in C.<\/p>\n 1. Statically:-<\/strong> In C, you can implement a queue using an array. It allows static memory allocation of its data elements. In this, the queue inherits all the features of the array.<\/p>\n 2. Dynamically:-<\/strong> You can also implement a queue using a linked list. It allows dynamic memory allocation of its data elements. In this, the queue takes over the characteristics of the linked list.<\/p>\n NOTE:-<\/strong> You can implement both stacks and queues statically or dynamically. It depends on you.<\/p>\n You can implement the queue using an array in C. And arrays support static memory allocation of its data elements. Before running the program code, you have to declare the size of the array in advance.<\/p>\n In the queue, you can perform three basic operations such as insertion, deletion and display.<\/p>\n In the queue, you can insert an element from the rear end of the queue. In queue, insertion of an element is called enqueue.<\/p>\nImplementing Stack in C using an array:-<\/h3>\n
1. Insertion:-<\/h4>\n
![\"Insertion](\"https:\/\/techvidvan.com\/tutorials\/wp-content\/uploads\/sites\/2\/2021\/07\/Insertion-in-Stack.jpg\")
<\/a><\/p>\n#define SIZE 50\nvoid push()\n{\nint stack[SIZE], top, num;\nif(top == SIZE- 1)\n{\nprintf(\"Please increase the size of the array! If you don't then the stack overflows!\\n\");\n}\nelse\n{\nprintf(\"TechVidvan Tutorial: Pushing a value to the stack!\\n\");\nnum = 20;\ntop++;\nstack[top]=num;\n}\n}<\/pre>\n2. Deletion in Stack:-<\/h4>\n
<\/a><\/p>\n#define SIZE 50\nvoid pop()\n{\nint stack[SIZE], top, num;\nif(top == -1)\n{\nprintf(\"The Stack is empty\\n\"); \/\/ Stack Underflow!\n}\nelse\n{\nnum=stack[top];\nprintf(\"TechVidvan Tutorial: Popping an element from the stack!\\n\");\nprintf(\"Deleted the %d item.\\n\",stack[top]);\ntop--;\n}\n}<\/pre>\n3. Display Stack Elements using C<\/h4>\n
#define SIZE 50\nvoid print()\n{\nint stack[SIZE], top, n;\nif(top == -1)\n{\nprintf(\"The stack is empty!\\n\"); \/\/ Stack Underflow!\n}\nelse if(top > 0)\n{\nprintf(\"Elements of the stack are:\\n\");\nfor(n = top; n >= 0; n--)\n{\nprintf(\"%d\\n\",stack[n]);\n}\n}\n}<\/pre>\nStack Overflow:-<\/h4>\n
Stack Underflow:-<\/h4>\n
#include <stdio.h>\n#include <stdlib.h>\n#define SIZE 100\n\nint stack[SIZE];\nint top;\nint a;\nint your_choice;\n\nvoid push();\nvoid pop();\nvoid print();\n\nint main()\n{\n\nprintf(\"TechVidvan Tutorial: Array Implementation of Stack in C!\\n\\n\");\ntop = -1; \/\/ indicating that the stack is empty!\ndo\n{\nprintf(\"1. Insert an Element!\\n2. Delete an Element!\\n3. Display the elements of the stack!\\n4. Please Exit!\\n\\n\");\nprintf(\"Enter your choice from the above: \");\nscanf(\"%d\",&your_choice);\nswitch(your_choice)\n{\ncase 1:\npush();\nbreak;\ncase 2:\npop();\nbreak;\ncase 3:\nprint();\nbreak;\ncase 4:\nexit(0);\nbreak;\ndefault:\nprintf(\"Soory, Please enter a valid choice!\\n\");\nbreak;\n}\n}while(your_choice!=4);\nreturn 0;\n}\nvoid push()\n{\nint value;\nif(top == SIZE- 1)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse\n{\nprintf(\"Enter the element to push into the stack: \");\nscanf(\"%d\", &value);\nprintf(\"Element added!\\n\");\ntop++;\nstack[top]=value;\n}\n}\nvoid pop()\n{\nint value;\nif(top == -1)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse\n{\nvalue=stack[top];\nprintf(\"Deleted the element: %d\\n\",stack[top]);\nprint(\"Deleted!\\n\");\ntop--;\n}\n}\n\nvoid print()\n{\nif(top == -1)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse if(top > 0)\n{\nprintf(\"Elements of the stack are: \\n\");\nfor(a = top; a >= 0; a--)\n{\nprintf(\"%d\\n\",stack[a]);\n}\n}\n}<\/pre>\n
\n2. Delete an Element!
\n3. Display the elements of the stack!
\n4. Please Exit!Enter your choice from the above: 1
\nEnter the element to push into the stack: 23
\nElement added!
\n1. Insert an Element!
\n2. Delete an Element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nEnter the element to push into the stack: 23
\nElement added!
\n1. Insert an Element!
\n2. Delete an Element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nEnter the element to push into the stack: 4
\nElement added!
\n1. Insert an Element!
\n2. Delete an Element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nDeleted the element: 4
\nElements of the stack are:
\n4
\n23
\n23
\n1. Insert an Element!
\n2. Delete an Element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nElements of the stack are:
\n23
\n23
\n1. Insert an Element!
\n2. Delete an Element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\nImplementing stack in C using a Linked List:-<\/h3>\n
1. Insertion in Stack using Linked List:-<\/h4>\n
void push()\n{\nint value;\nstruct node *ptr = (struct node*)malloc(sizeof(struct node));\nif(ptr == NULL)\n{\nprintf(\"The Stack is Full!\\n\");\n}\nelse\n{\nprintf(\"Enter the element which you want to insert: \");\nscanf(\"%d\",&value);\nif(tmp == NULL)\n{\nptr -> value = value;\nptr -> next = NULL;\ntmp = ptr;\n}\nelse\n{\nptr -> value = ptr;\nptr -> next = tmp;\ntmp = ptr;\n}\n}\n}\n<\/pre>\n2. Deletion of Stack element using linked list<\/h4>\n
void pop()\n{\nint element;\nstruct node *ptr;\nif (tmp == NULL)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse\n{\nelement = temp -> value;\nptr = tmp;\ntmp = tmp -> next;\nfree(ptr);\nprintf(\"Deleted the element: %d\\n\",element);\n}\n}\n<\/pre>\n3. Display Stack Elements<\/h4>\n
void print()\n{\nint a;\nstruct node *ptr;\nptr = tmp;\nif(ptr == NULL)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse\n{\nprintf(\"Elements of the stack are: \\n\");\nwhile(ptr!= NULL)\n{\nprintf(\"%d\\n\",ptr -> value);\nptr = ptr -> next;\n}\n}\n}<\/pre>\n#include <stdio.h>\n#include <stdlib.h>\n\nvoid push();\nvoid pop();\nvoid print();\nstruct node\n{\nint value;\nstruct node *NEXT;\n};\nstruct node *tmp;\n\nint main()\n{\n\nprintf(\"TechVidvan Tutorial: Stack Implementation using Linked Lists!\\n\\n\");\nint your_choice;\ndo\n{\nprintf(\"1. Insert an element!\\n2. Delete an element!\\n3. Display the elements of the stack!\\n4. Please Exit!\\n\\n\");\nprintf(\"Please enter your choice from the above: \");\nscanf(\"%d\",&your_choice);\n\nswitch(your_choice)\n{\ncase 1:\npush();\nbreak;\ncase 2:\npop();\nbreak;\ncase 3:\nprint();\nbreak;\ncase 4:\nexit(0);\nbreak;\ndefault:\nprintf(\"Sorry, Please choose a invalid choice!\\n\");\nbreak;\n}\n} while(your_choice!=4);\nreturn 0;\n}\n\nvoid push()\n{\nint value;\nstruct node *ptr = (struct node*)malloc(sizeof(struct node));\nif(ptr == NULL)\n{\nprintf(\"The Stack is full!\\n\");\n}\nelse\n{\nprintf(\"Enter the element which you want to push into the stack: \");\nscanf(\"%d\",&value);\nprintf(\"Element added!\\n\");\nif(tmp == NULL)\n{\nptr -> value = value;\nptr -> NEXT = NULL;\ntmp = ptr;\n}\nelse\n{\nptr -> value = value;\nptr -> NEXT = value;\ntmp = ptr;\n}\n}\n}\n\nvoid pop()\n{\nint element;\nstruct node *ptr;\nif (tmp == NULL)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse\n{\nelement = tmp -> value;\nptr = tmp;\ntmp = tmp -> NEXT;\nfree(ptr);\nprintf(\"Deleted the element: %d\\n\",element);\nprintf(\"Deleted!\\n\");\n}\n}\nvoid print()\n{\nint a;\nstruct node *ptr;\nptr = tmp;\nif(ptr == NULL)\n{\nprintf(\"The Stack is empty!\\n\");\n}\nelse\n{\nprintf(\"Elements of the stack are: \\n\");\nwhile(ptr!= NULL)\n{\nprintf(\"%d\\n\",ptr->value);\nptr = ptr -> NEXT;\n}\n}\n}\n<\/pre>\n
\n2. Delete an element!
\n3. Display the elements of the stack!
\n4. Please Exit!Please enter your choice from the above: 1
\nEnter the element which you want to push into the stack: 23
\nElement added!
\n1. Insert an element!
\n2. Delete an element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nEnter the element which you want to push into the stack: 34
\nElement added!
\n1. Insert an element!
\n2. Delete an element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nEnter the element which you want to push into the stack: 56
\nElement added!
\n1. Insert an element!
\n2. Delete an element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n
\nDeleted the element: 56
\nDeleted!
\n1. Insert an element!
\n2. Delete an element!
\n3. Display the elements of the stack!
\n4. Please Exit!<\/p>\n<\/div>\nApplications of Stack in C:-<\/h3>\n
What is a Queue in C?<\/h3>\n
<\/a><\/p>\nImplementing Queue in C using an array:-<\/h3>\n
1. Insertion in Queue using C<\/h4>\n