Stack implementation by linked list by R4R Team

What is Stack ?
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).

How Stack Implement in C ?
There are two ways by which we can implement the stack, i.e.,

Array implementation:
We use Array data Structure To implement the Stack. We make a array and one top variable that take care of top of the stack.
Learn more.

Linklist implementation:
We use Linklist To implement all operation on Stack.
Learn more.

Basic Task Perform on Stack :
Push() : Insertion in Stack
pop() : Deletion in Stack
peek() : Return top Most Element
isEmpty() : Return True if Stack is Empty

-Application of Stack :
-Expression Evaluation
-Expression Conversion
-Syntax Parsing
-Backtracking
-Parenthesis Checking
-String Reversal
-Function Call

Click On Following Links to Learn Opeartion on Stack
Create a Stack
Traverse A Stack
Insertion In Stack
Deletion In Stack
Swap Top Two Element Of Stack




Leave a Comment:
Search
Categories
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!