StackArray

Stack Array implementaion

1. StackArrayImpl.java

 package com.nrs.ds.basic;  
 public class StackArrayImpl<T> {  
      Object[] ArrayStack;  
      int size;  
      int top;  
      public StackArrayImpl(int size){  
           this.size = size;  
           ArrayStack = new Object[this.size];  
           top =-1;  
      }  
      public Boolean isFull(){  
           return (top == size-1);  
      }  
      public Boolean isEmpty(){  
           return top == -1;  
      }  
      public void push(Object newItem){  
           if(isFull()){  
                System.out.println("Stack is full");  
                return;  
           }  
           top = top + 1;  
           ArrayStack[top] = newItem;  
      }  
      public T pop(){  
           if(isEmpty()){  
                System.out.println("Stack is Empty");  
                return null;  
           }  
           T item = (T)ArrayStack[top];  
           top = top - 1;  
           return item;  
      }  
 }
2. Test 

 package com.nrs.ds.basic;  
 public class StackArrayTest {  
      public static void main(String[] args) {  
           StackArrayImpl< Integer> sa= new StackArrayImpl<Integer>(3);  
           sa.push(10);  
           sa.push(11);  
           sa.push(12);  
           sa.push(14);  
           while(!sa.isEmpty()){  
                System.out.println(sa.pop());  
           }  
           sa.pop();  
      }  
 }
Output:

Comments

Post a Comment

Popular posts from this blog

Tournament Tree or Winner Tree

Image
Tournament Tree or Winner Tree :  Is a form of min(max) heap which is a complete binary tree. every external node represents a player and internal node represents a winner. Winner: select the best player among N palyers , (N -1) players to be eliminated. we need minimum of (N-1) games (comparisons). Second best player: we can pick second best player in (N + log2(n-2)) comparisons.   The above tree contains 4 leaf nodes that represent players and have 3 levels 0, 1 and 2. Initially 2 games are conducted at level 2, one between 5 and 3 and another one between 7 and 8. In the next move, one more game is conducted between 5 and 8 to conclude the final winner. Overall we need 3 comparisons. For second best player we need to trace the candidates participated with final winner, that leads to 7 as second best. Uses: Tree selection sort using tournament tree.  
Read more

Linked List

Image
single linked list: 1. Node class NodeLL.java package com.nrs.ds.basic; public class NodeLL { Object value; NodeLL next; public NodeLL(Object value,NodeLL next){ this.value=value; this.next = next; } } 2. LinkedList implementation LinkedListImpl.java package com.nrs.ds.basic; public class LinkedListImpl<T> { NodeLL head; public LinkedListImpl(){ head = null; } public void add(Object value){ NodeLL newNode= new NodeLL(value,null); if(head == null){ head=newNode; }else{ newNode.next = head; head = newNode; } } public void delete(){ head = head.next; } public void display(){ NodeLL n=head; while(n != null){ System.out.println((T)n.value); n = n.next; } } ...
Read more

Heaps

Image
 A Binary Heap is either Min Heap or Max Heap. Min Binary Heap: the key at root must be minimum among all keys present in Binary Heap. the same property must be recursively true for all nodes in Binary Tree. Min Binary Heap: The key at root must be maximum among all keys present in Binary Heap. the same property must be recursively true for all nodes in Binary Tree. Binamial Heap: Binamial Heap  is a Extention of Binary Heap that provides faster union or merge operations together with other operations provided by Binary Heap. Is a collection of tinomial trees. Binamial Tree Tree: A binomial Tree of order 0 has 1 node. A binomial Tree oder k can be constructed by taking two binomial trees of order k-1, and making one as leftmost child of other.  Binomial Heap: Is a set of Binomial Tree where each Binomial Tree follows Min Heap Property. and there can be at-most one Binomial Tree of any degree. Fibonacci Heap:  In terms of Time Com...
Read more