NushratJabenAurnima/Implementation_of_Stack

This problem highlights the basic implementations Stack using both array and Linked List.

Problem Statement

A stack is an Abstract Data Type (ADT), commonly used in most programming languages. In stack terminology, insertion operation is called PUSH operation and removal operation is called POP operation. It follows the principle of Last in First out(LIFO).

The system allows the following features:

. User Input

. Push

. Pop

. Display

The system contains the following functions:

. IsFull()

. IsEmpty()

. push()

. print()

. pop()