Stack

A Stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle. Elements are added and removed from the same end (top). Common operations include push, pop, and peek.

Stack Visualization

Ultra-Premium Interactive Engine

Stack Visualizer V3

A cinematic, high-fidelity simulation of a LIFO data structure with synchronized motion, code, memory and feedback systems.

Size

0

Top

—

Mode

LIVE

Removed

—

Speed1.0x
State: EMPTY
Runtime: Interactive
Complexity: Push O(1) • Pop O(1)
Capacity: 0/7

Stack chamber is empty

Insert a value using Push to begin the sequence.

Synchronized Logic

1function push(value) {
2 if (stack is full) return;
3 top = top + 1;
4 stack[top] = value;
5}
6
7function pop() {
8 if (stack is empty) return;
9 value = stack[top];
10 top = top - 1;
11 return value;
12}

Complexity

Time Complexity: O(1) for push/pop/peek
Space Complexity: O(n)

Pseudocode

class Stack:
  function push(item):
    stack.append(item)
  
  function pop():
    if stack is empty:
      return error
    return stack.remove_last()
  
  function peek():
    return stack[last_index]

Related Algorithms

Queue

A Queue is a linear data structure that follows the First-In-First-Out (FIFO) principle. Elements are added at the rear and removed from the front. Common operations include enqueue and dequeue.

Time: O(1) for enqueue/dequeue | Space: O(n)

Linked List

A Linked List is a linear data structure where elements are stored in nodes, and each node points to the next node. It allows dynamic memory allocation and efficient insertion/deletion operations.

Time: O(1) for insert/delete, O(n) for search | Space: O(n)