The stack abstract data type

This post is the second post of the data structures.This post will be cover the main topic in data structures.
  •  The stack abstract data type.

First let's discuss about the first topic.

The stack abstract data type

The stack abstract data type is defined by the following structure and operations.
The stack ordered "Last in first out" mechanism.

The stack operations are given below.

stack( )
  • creates a new stack that is empty. It needs no parameters and returns an empty stack.

push( item )
  • adds a new item to the top of the stack. It needs the item and returns nothing.

pop( )
  • removes the top item from the stack. It needs no parameters and returns the item.The stack  is not modified.
peek( )
  • returns the top item from the stack but does not remove it. It needs no parameters. The stack is not modified.

isEmpty( )
  • tests to see whether the stack is empty. It needs no parameters and returns a Boolean.

size( )
  • returns the number of items on the stack. It needs no parameters and returns an integer.
 Let's See a simple Example of these operations.


Now I think you can clearly identify the stack abstract type and it's operations.

My next post will be implementing the stack using python.

I think you get some knowledge about stack abstract data type.

See you soon.
Thank you

Comments

Post a Comment

Popular posts from this blog

Algorithm I

Image
This is the first post in Algorithms.From this post I am looking forward to write about sorting algorithms. Sorting Algorithms What are Sorting Algorithms A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms which require input data to be in sorted lists. Some main sorting algorithms are : Insertion Sort. Selection Sort. Bubble Sort Merge Sort. Counting Sort. Quick Sort. Radix Sort.  Let's see about the first sorting with more details. Insertion Sort Insertion sort is a simple sorting algorithm that is relatively efficient for small lists and mostly sorted lists, and often is used as part of more sophisticated algorithms. It works by taking elements from the list one by one and inserting them in their correct position into a new sorted list. In arrays, the new list and the remaini...
Read more

love java programming

My First java programme This is the very first post in my blog. All knows this " Hello world " programme. public class HelloWorld {        public static void main(String args[ ]){            System.out.println("Hello world") ;        } }  out put of the programme -                                   Hello world There are two types of print statements       1. System.out.print( );       2. System.out.println( ); Example - public class Test{        public static void main(String args[]){            System.out.print("Hello world");            System.out.println(" Good morning ");            System.out.println("Hello world");            Sy...
Read more

Loops

Image
A simple introduction about Loops in java programming There are mainly three types of loops.                  1.For loop                  2.While loop                  3.Do While loop As in the name the "Loop" means a cycle ,which it stops after a certain boolen condition. In this post i will describe about the For loop. Here is a small Example for the for loop. class Myjava {     public static void main(String args[]){         for(int x=0 ; x<5 ; x++){         System.out.print("kamal-->");         System.out.println(x);         }     } } out put of the ...
Read more