Stack Program in C using an Array – Stack Tutorial Part – I

Write a stack program in C using an array. Implement a stack data structure using an Array. In this tutorial, We’ll learn about stack data structure and it’s implementation using an array.

C Program to Implement a Stack using Linked List

What is a Stack in Data Structure?

A Stack is a Data Structure, in which insertion and deletion operations are allowed only at one end. It worked on LIFO (Last In First Out) Principle. In LIFO, an element which inserted last must be the first element to be removed.

In Stack, Insertion and Deletion operations are known as push and pop.

Push – To insert an element in a Stack.
Pop – To delete an element from a Stack.

MCQ on Stack  and Queue Data Structure

There are certain conditions we need to check before push and pop operations. Before push operation, we need to check whether there is a sufficient space available for a new element. If memory is not available, then it’s called as Stack Overflow. Similarly in pop operation, if a stack is empty, then it’s called as Stack Underflow.

Where Stack Data Structure is Used

1. Stack data structure is used when a function is called.

2. To convert Infix to Postfix expression.

3. Evaluation of Postfix and Prefix expression.

4. In recursive function.

Stack Program in C using an Array

We can implement a stack through an array or a linked list. In this tutorial, We’ll learn to implement a stack using an array. You can check my previous post on a C Program to Implement a Stack using Linked List.

Output-

Subscribe Our Tutorials

Get Latest Updates on Facebook

Push value is 2
Push value is 4
Push value is 6

Pop value is 6
Pop value is 4
Pop value is 2

Stack Program in C using an Array

Stack Program in C using an Array

Explanation

In the above program, we have defined an array of size 50. In a push() method we have first checked the stack overflow (whether a memory is available for inserting an element) conditionAfter that, we have pushed the value in an array and increment the value of a top index.

Similarly, In a pop() method first, we checked stack underflow condition. After that, we have removed last pushed element and decremented the value of a top index.

Excellent Books for Data Structure

Data Structure Books on Flipkart

Data Structure Books on Amazon

About WebRewrite

I am technology lover who loves to keep updated with latest technology. My interest field is Web Development.
Tagged , , , . Bookmark the permalink.