JavaScript Exercises: Reverse the elements of a stack

JavaScript Stack: Exercise-4 with Solution

Reverse Stack

Write a JavaScript program to reverse the elements of a given stack.

Sample Solution:

JavaScript Code:

class Stack {
  constructor() {
    this.items = [];
  }
  
  // Pushes an element onto the stack
  push(element) {
    this.items.push(element);
  }
  
  // Remove the top element from the stack and return it
  pop() {
    if (this.items.length == 0)
      return "Underflow";
    return this.items.pop();
  }
  
  // Checks if the stack is empty
  isEmpty() {
    return this.items.length == 0;
  }
  
 // Returns the top element of the stack
  peek() {
    if (this.items.length == 0)
      return "No elements in Stack";
    return this.items[this.items.length - 1];
  }

 displayStack(stack) {
   console.log("Stack elements are:");
   let str = "";
   for (let i = 0; i < stack.items.length; i++)
     str += stack.items[i] + " ";
   return str.trim();
  }
  
reverse_stack(stack) {
  let tempStack = new Stack();

  // Pop each element from the original stack and push it onto the tempStack
  while (!stack.isEmpty()) {
    tempStack.push(stack.pop());
  }
  // Return the tempStack containing the reversed elements
  return tempStack;
 }
}
console.log("Initialize a stack:")
let stack = new Stack();
console.log("Input some elements on the stack:")
stack.push(1);
stack.push(4);
stack.push(3);
stack.push(2);
stack.push(5);
console.log(stack.displayStack(stack));
let reversedStack = stack.reverse_stack(stack);
console.log("The elements of the stack in reverse order:")
console.log(stack.displayStack(reversedStack));

Sample Output:

Initialize a stack:
Input some elements on the stack:
Stack elements are:
1 4 3 2 5
The elements of the stack in reverse order:
Stack elements are:
5 2 3 4 1

Flowchart:

Live Demo:

See the Pen javascript-stack-exercise-4 by w3resource (@w3resource) on CodePen.

For more Practice: Solve these Related Problems:

• Write a JavaScript function that reverses a stack using recursion without using any auxiliary data structures.
• Write a JavaScript function that reverses the elements of a stack by using an additional temporary stack.
• Write a JavaScript function that reverses a stack implemented as a linked list without altering the node connections permanently.
• Write a JavaScript function that reverses a stack and verifies the reversal by comparing the original and reversed sequences.

Go to:

• JavaScript Stack Exercises Home ↩
• JavaScript Exercises Home ↩

PREV : Sort Stack Ascending.
NEXT : Max & Min in Stack.

Improve this sample solution and post your code through Disqus