Stack

data-structures

Click Generate New or press Play

Step 1 / 1

Ready

Speed

Last-In-First-Out (LIFO) data structure. Elements are added and removed from the top.

Time Complexity

Best

\mathrm{O}\left(1\right)

Avg

\mathrm{O}\left(1\right)

Worst

\mathrm{O}\left(1\right)

Space Complexity

Aux

\mathrm{O}\left(n\right)

n elements stored in the stack array

Pseudocode

1Stack Operations:

2push(value): add to top

3pop(): remove from top

4peek(): view top element

5isEmpty(): check if empty