AlgoViz: Interactive Algorithm Visualization Tool

Stack

Category: Data Structures | Time: O(1) | Space: O(n)

Input Data

Visualization

Visual representation of the data structure

Enter commands to start stack visualization.

About Stack

A linear data structure that follows the Last-In, First-Out (LIFO) principle. Elements are added (pushed) and removed (popped) from the same end, called the 'top'.

Code Editor

The code is for reference. Editing it won't affect the visualization.

class Stack {
  constructor() {
    this.items = [];
  }
  push(element) {
    this.items.push(element);
  }
  pop() {
    if (this.isEmpty()) {
      return "Underflow";
    }
    return this.items.pop();
  }
  peek() {
    return this.items[this.items.length - 1];
  }
  isEmpty() {
    return this.items.length === 0;
  }
}

Frequently Asked Questions

About Stack

Valid Parentheses

From: Amazon

View Question

What is a Stack?

What are the primary operations of a Stack?

What is the time complexity of stack operations?

Where are stacks used in computing?

What is a stack overflow?

What is a stack underflow?

How can a Stack be implemented?

What's the difference between a Stack and a Queue?

Where can I learn more?

Valid Parentheses