Skip to main content
C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle
SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs
Beginner 8 planned topics Algorithms

Introduction to Stack

Learn the stack data structure: LIFO, operations, and interview problems. Free stack introduction.

Learning Outcomes

  • Implement push, pop, and peek
  • State time complexity for those operations
  • Solve a parentheses-matching example
  • Relate the call stack to recursion

Overview

A stack is last-in, first-out. Push, pop, and peek are the three operations you must know cold.

This introduction connects stacks to undo, call stacks, and balanced parentheses.

Implementations may use arrays or linked lists.

What this course will cover

  1. 1. LIFO
  2. 2. Array stack
  3. 3. Linked stack
  4. 4. Applications
  5. 5. Infix/postfix idea
  6. 6. Practice

Start a complete tutorial now

Full 6-level lessons are live for C, C++, Java, Python, and JavaScript. Use them while the remaining Stack lessons are added.

← All technology tutorials