Home

Welcome to the home wiki!

Stack data structure

It is a linear data structure. It uses the LIFO principle(last in first out).An example of a stack is a loaf of bread. The last slice is found at the top and it is the first to be removed and the last to be inserted.

One is prompted to do various operations in a stack.They include:

Insertion-push()

####deletion-pop()->This only removes the last element to be inserted which is the element at the top.