Suppose that you have a stack S and an empty auxiliary stack T. Show how you can

Question

Suppose that you have a stack S and an empty auxiliary stack T. Show how you can display the contents of S in reverse order (that is, display the top of S last) by using only the abstract data type operations push, pop, and isEmpty. You may assume that the operations are implemented as methods of the stack objects S and T. Please express your answer using Java syntax. Do not write a method for your answer but just give the code to do the task described above. S and T already exist; do not declare or create them. You do not know the class name of S and T; you just know they are stacks and have the methods described above. You can also use standard Java constructs such as conditionals, looping, and console display. You cannot, however, use any other Java data structures, methods, classes, etc. You can also assume that the println method knows how to process the value of an element of the stacks, but you cannot assume the stack object has a toString method.

Explanation / Answer

Since the Question is to only write code for specific task and not to include any creation of Objects, I'm not attaching any screenshot of Output. Below two while loop can do the required task given S and T are already created.

// Loop until S becomes empty
while(!S.isEmpty())
{
// pop an element from S and push the popped element to T
T.push(S.pop());
}

// Now is T is having all the elements of S in reverse order
// i.e top of S is now at bottom of T

// Loop until T becomes empty
while(!T.isEmpty())
{
// pop each element of T and print it
System.out.println(T.pop());
}

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.