Implementation of Stack in Java
//* Implementation of Stack in Java *//
import java.util.*;
public class StackOperation {
public static void main(String []args) {
String s1="a";
String s2="b";
String s3="c";
String s4="d";
String s5="e";
Stack s=new Stack();
System.out.println("\n\nPUSHING ELEMENTS TO STACK");
System.out.println("----------------------------");
System.out.println("ELEMENT NAME POSITION");
System.out.println(s.push(s1)+"\t\t "+s.search(s1));
System.out.println(s.push(s2)+"\t\t "+s.search(s2));
System.out.println(s.push(s3)+"\t\t "+s.search(s3));
System.out.println(s.push(s4)+"\t\t "+s.search(s4));
System.out.println(s.push(s5)+"\t\t "+s.search(s5));
System.out.println("\nTop most element in the stack: "+s.peek());
System.out.println("\n\n\nNEW POSITION OF ELEMENTS");
System.out.println("----------------------------");
System.out.println("ELEMENT NAME POSITION");
System.out.println(s1+"\t\t "+s.search(s1));
System.out.println(s2+"\t\t "+s.search(s2));
System.out.println(s3+"\t\t "+s.search(s3));
System.out.println(s4+"\t\t "+s.search(s4));
System.out.println(s5+"\t\t "+s.search(s5));
System.out.println("\nTop most element in the stack: "+s.peek());
System.out.println("\n\n\nPOPING ELEMENTS FROM STACK");
System.out.println("----------------------------");
System.out.println("Element recently popped out: "+s.pop());
System.out.println("\n\n\nNEW POSITION OF ELEMENTS");
System.out.println("----------------------------");
System.out.println("ELEMENT NAME POSITION");
System.out.println(s1+"\t\t "+s.search(s1));
System.out.println(s2+"\t\t "+s.search(s2));
System.out.println(s3+"\t\t "+s.search(s3));
System.out.println(s4+"\t\t "+s.search(s4));
System.out.println(s5+"\t\t "+s.search(s5));
System.out.println("\nTop most element in the stack: "+s.peek());
if(s.empty()) {
System.out.println("\n\n\n\t\t\tWARNING: The stack is empty...");
}
}
}
Output:
[pic]
//* Implementation of Queue in Java *//
import java.util.*;
public class Queue_program {
public static void main(String []args) {
Queue q=new LinkedList();
String s[]={"a","b","c","d","e"};
for(int i=0;i ................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.