representing Stack using Queues

Use two queues to simulate the basic operations of a stack. The template for the class is given below:

class SimulateStack {

ArrayQueue que1;

ArrayQueue que2;

int size;

// constructor

public SimulateStack() {

que1 = new ArrayQueue();

que2 = new ArrayQueue();

size = 0;

}

/** @return true iff stack is empty */

public boolean empty() {

// your codes here

}

/**

* @return top element of stack

* @throws EmptyStackException

* when the stack is empty

*/

public Object peek() {

// your codes here

}

/** add theElement to the top of the stack */

public void push(Object theElement) {

// your codes here

}

/**

* remove top element of stack and return it

*

* @throws EmptyStackException

* when the stack is empty

*/

public Object pop() {

// your codes here

}

/** Print the content in the stack */

public void printTheStack() {

// your codes here

}

public static void main(String args[]) {

SimulateStack ss = new SimulateStack();

ss.push("1");

ss.push("2");

ss.push("3");

ss.printTheStack();

System.out.println("-");

System.out.println(ss.peek());

System.out.println("-");

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.printTheStack();

}

}

johnsmith954a at 2007-7-9 21:43:56 >