JAVA

Let Q be a non-empty queue, and let S be an empty stack. Using only the stack and queue ADT functions and a single element variable X, write an algorithm to reverse the order of the elements in Q.

This is the required output:

< Oranges Apples Bananas Dragonfruites Strawberries Peaches Melons Pears Apricots Watermelons > < Watermelons Apricots Pears Melons Peaches Strawberries Dragonfruites Bananas Apples Oranges > 

Here is the code that I have so far:

import java.util.StringTokenizer;

public class Main {

public static void main(String[] args) {

Queue q = new AQueue(100);

Stack s = new AStack(100);

String input = "Oranges Apples Bananas Dragonfruites Strawberries Peaches Melons Pears Apricots Watermelons";

StringTokenizer st = new StringTokenizer(input);

while(st.hasMoreTokens())

q.enqueue(st.nextToken());

System.out.println(q);

//you should only use q and s no other arrays or other data structures

//you should nt use a for loop (only while loop)

//you just need two while loops and a print statement

//you should not use any other variable other than whats already on the screen

}

}