Saturday, 30 April 2016

Stack in C (DS)

Stack  in C  


Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Mainly the following three basic operations
 are performed in the stack:

*Push: - Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.

*Pop:- Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.

*Peek:- Get the topmost item.

Syntax of stack which is used in C
// C program for array implementation of stack

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
// A structure to represent a stack
struct Stack
    int top;
    unsigned capacity;
    int* array;

No comments:

Post a Comment