Stack is a data structure it serves as a collection of elements. It has 2 principle operation push and pop.Stack works on the principle of Last In First Out or LIFO i.e the element that is entered last is removed first. To do this is has 2 methods

**push**() : push operation pushes the element on the top.**pop**() : pop operation removes the element on the top.

**Linked list**is a simple linear data structure formed by collection of data elements called nodes. Each node consists of a data element and link field.The data field consists of element and link field consists of address of next element.

To know more about Stack Data Structure click

**here**

To know more about Linked List click

**here**

To view Simple Linked List implementation click

**here**

Now inorder to implement Stack using linked list we need to implement push and pop operation in Linked List. Push and pop can be implemented by using other already implemented functions of Linked List like addToStart, addToEnd and remove functions.

### C++ Program

### Sample input and output to check the program

Queue implementation using Linked List

Linked List in Java

Linked List in c++

Binary Search Tree

Height of Binary Search Tree

Your blog explained clearly about the recent talks in the industry. For Software Courses:

ReplyDeletePHP Training in Chennai

web designing course in chennai

JAVA Training in Chennai

Hadoop Training in Chennai

Selenium Training in Chennai

German Classes in chennai

Qtp training in Chennai

Qtp training in Tambaram