Add the following operation to the class stackType. void reverseStack (stackType &other Stack); This operation copies the elements of a stack in reverse order onto anothe stack. Consider the following statements: stackType stackl; stackType stack2; The statement stack1.reverseStack (stack2); copies the elements of stack1 onto stack2 in reverse order. That is, th top element of stack1 is the bottom element of stack2, and so on. The ol contents of stack2 are destroyed, and stack1 is unchanged. Write the definition of the function template to implement the operation reverseStack.

Add the following operation to the class stackType. void reverseStack (stackType &other Stack); This operation copies the elements of a stack in reverse order onto anothe stack. Consider the following statements: stackType stackl; stackType stack2; The statement stack1.reverseStack (stack2); copies the elements of stack1 onto stack2 in reverse order. That is, th top element of stack1 is the bottom element of stack2, and so on. The ol contents of stack2 are destroyed, and stack1 is unchanged. Write the definition of the function template to implement the operation reverseStack.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

Add the following operation to the Class StackClass: void reverseStack(StackClass<T> otherStack); This operation copies the elements of a stack in reverse order onto another stack. Consider the following statements: StackClass<T> stack1; StackClass<T> stack2; The statement stack1.reverseStack(stack2); copies the elements of stack1 onto stack2 in the reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged. Write the definition of the method to implement the operation reverseStack. Also write a program to test the method reverseStack. In StackClass.java, please finish method - public void reverseStack(StackClass<T> otherStack) and testing main program public class Problem53{public static void main(String[] args){StackClass<Integer> intStack = new StackClass<Integer>();StackClass<Integer> tempStack = new StackClass<Integer>(); //Please…
Define a stack class called DLStack, in such a way that it can store any type of data. All data in a DLStack must be stored in a DoublyLinkedList instance. Implement the following member methods: push – Pushes a new element into the stack. pop – Removes the top element from the stack. top – Retrieves the top element from the stack. IsEmpty – Returns true if the stack is empty, and false otherwise. Note: These operations should add or remove the element from the head of the DoublyLinkedList instance. Q1) Implement the following non-member function which reverses a given string. String reversal must be done using stack-based logic. void ReverseString(string &); Q2) Implement the following function which determines whether a given string is the reverse of the second one; for example “test string” is the reverse of “gnirts tset”. Reverse detection must be done using stack-based logic. bool IsReverse(const string &, const string &);…
Add the following operation to the Class StackClass: void reverseStack(StackClass<T> otherStack); This operation copies the elements of a stack in reverse order onto another stack. Consider the following statements: StackClass<T> stack1; StackClass<T> stack2; The statement stack1.reverseStack(stack2); copies the elements of stack1 onto stack2 in the reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged. Write the definition of the method to implement the operation reverseStack. Also write a program to test the method reverseStack. In StackClass.java, please finish method - public void reverseStack(StackClass<T> otherStack) and testing main program – Problem53.java. Note: java programming, please use given outline code public class Problem53{ publicstaticvoidmain(String[] args){ StackClass<Integer> intStack = newStackClass<Integer>();…
Problem 2: Assume that the methods push(), pop() and isEmpty() methods are defined as they should be in a Stack class. Assume further that the Stack class has a no argument constructor. Write a method that uses the constructor and the methods push(), pop() and isEmpty() for removing and returning the bottom element of a given stack. Note: make sure that you don't include unnecessary spaces in your answers! public T popBottom(Stack stack) { Stack tempStack = new Stack(); Tx = null; if (!stack.isEmpty()) { x = stack.pop(); } while (!stack.isEmpty()) { #04 ; x = stack.pop(); } while (!tempStack.isEmpty()) { #05 ; } return x; }
A data structure known as a drop-out stack functions exactly like a stack, with the exception that if the stack size is n, the first element is lost when the n + 1 element is pushed. Use an array to implement a drop-out stack. (Hint: It would make sense to implement a circular array.)
Java: Two stacks are the same if they have the same size and their elements at the corresponding positions are the same. Add the method equalStack to Class StackClass that takes as a parameter a StackClass object, say otherStack and return true if the stack is the same as otherStack. Also write the definition of method equalStack and a program to test your method. In StackClass.java, please finish method - public boolean equalStack(StackClass<T> otherStack) and testing main program public class Problem52{public static void main(String[] args){StackClass<Integer> intStack = new StackClass<Integer>(50);StackClass<Integer> tempStack = new StackClass<Integer>(50);//Please add your code here!}} public class StackClass<T> implements StackADT<T>{private int maxStackSize; //variable to store the//maximum stack sizeprivate int stackTop; //variable to point to//the top of the stackprivate T[] list; //array of reference variables //Default…
A data structure known as a drop-out stack functions exactly like a stack, with the exception that if the stack size is n, the first element is lost when the n + 1 element is pushed. Apply an array to a drop-out stack. (Hint: It would make sense to implement a circular array.)
A Stack is a data structure for storing a list of elements in a LIFO (last in, first out) fashion. Design a class called Stack with three methods. void Push(object obj)object Pop()void Clear() We should be able to use this stack class as follows:var stack = new Stack();stack.Push(1);stack.Push(2);stack.Push(3);Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop()); The output should be 3, 2, 1
Create an interface called Stack with methods Push (), Pop () and property Length.Create a class that implements this interface. Use an array to implement stack datastructure. language C#
don't use others answers java 1. Write a generic static method that takes a Stack of any type element as a parameter, pops each element from the stack, and prints it. It should have a type parameter that represents the Stack’s element type.
Break out the restrictions placed on the stack and its unrestricted counterpart.
Working with Stacks 1. Create a method on the Stack class that determines whether a given value occurs consecutively in the stack. bool Stack::isConsecutive( const T & data ) const; Example: isConsecutive(…) function Result Stack isConsecutive (5) true top->(1) (1) (5) (3) (5) (5) (2) isConsecutive (3) false top->(1) (1) (5) (3) (5) (5) (5) (2) 2. Create a method on the Stack class that reverses the values on the stack. void Stack::reverse(); Example: reverse() function Stack original Result: Stack reversed reverse () top->(1) (1) (5) (3) (5) (5) (2) top->(2) (5) (5) (3) (5) (1) (1) reverse () top->(1) (1) (5) (3) (5) (5) (5) (2) top->(2) (5) (5) (5) (3) (5) (1) (1)