Stack

A stack is also an ordered collection of elements like arrays but it has a special feature that deletion and insertion of elements can be done only from one end called the top of stack (TOP) Due to this property it is also called as last in first out type of data structure (LIFO) It could be thought of just like a stack of plates placed on table in a party a guest always takes off a fresh the top and the new plates are placed onto the stack at the top. It is a non-primitive data structure.

When an element is inserted into a stack its base remains fixed whereas the top of stack changes. Insertion of element into stack is called Push and Deletion of element from stack is called pop the figure 1.3 shows how the operations take place on a stack.

The stacks can be implemented in two ways:

1 Using arrays (static implementation)

2 Using pointers (dynamic implementation)

Data Structure & Algorithms Assignment Help, Live Experts 

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.

ExpertsMind.com - Stack Assignment Help, Stack Homework Help, Stack Assignment Tutors, Stack Solutions, Stack Answers, Classification or Data Structure Assignment Tutors