Loading lesson… / 正在打开教程…

Courses Pro Get Pro Login / Register

Data Structures and Algorithms

Chapter 1: Computational Complexity Theory

1.1 Time and Space Complexity 1.2 Recurrence Relations 1.3 P = NP?

Chapter 2: Arrays

2.1 Search Algorithms 2.2 Array Insertion and Deletion 2.3 Implement a Generic Array

Chapter 3: Linked Lists

3.1 Types of Linked Lists 3.2 Finding Nodes 3.3 Singly Linked List Operations 3.4 Implement a Generic Singly Linked List 3.5 Doubly Linked List Operations 3.6 Implement a Generic Doubly Linked List

Chapter 4: Stacks

4.1 Stacks 4.2 Implement a Generic Stack 4.3 Parentheses Matching 4.4 Expression Evaluation

Chapter 5: Queues

5.1 Queues 5.2 Implement a Generic Queue 5.3 Deques

Chapter 6: Hash Tables

6.1 Hash Tables and Hash Functions 6.2 Constructing Hash Functions 6.3 Collisions and Open Addressing 6.4 Chaining and Performance

Chapter 7: Divide and Conquer

7.1 Divide and Conquer 7.2 Big Integer Arithmetic 7.3 Fast Exponentiation 7.4 Matrix Multiplication

Chapter 8: Sorting Algorithms

8.1 Sorting Algorithms 8.2 Bubble Sort 8.3 Selection Sort 8.4 Insertion Sort 8.5 Shell Sort 8.6 Merge Sort 8.7 Quick Sort 8.8 Counting Sort 8.9 Bucket Sort 8.10 Radix Sort 8.11 Bogosort

Chapter 9: Trees

9.1 Trees 9.2 Binary Tree Traversal 9.3 Binary Search Trees 9.4 Implement a Binary Search Tree 9.5 Huffman Trees 9.6 Heap Sort 9.7 AVL Trees

Chapter 10: Graphs

10.1 Graphs 10.2 Graph Representation 10.3 Graph Traversal 10.4 Connected Graphs 10.5 Shortest Paths 10.6 Minimum Spanning Trees 10.7 Topological Sort

Chapter 11: Greedy Algorithms

11.1 Greedy Algorithms 11.2 Distributing Cookies 11.3 Greedy Coin Change 11.4 Fractional Knapsack 11.5 Limitations of Greedy Algorithms

Chapter 12: Dynamic Programming

12.1 Dynamic Programming 12.2 Coin Change 12.3 Path Problems 12.4 Jump Game 12.5 0-1 Knapsack

Chapter 13: Pattern Matching

13.1 BF 13.2 Sunday 13.3 BM 13.4 KMP

Stacks

Implement a Generic Stack

Implement a Generic Stack

HANDS-ON PRACTICE

Implement a Generic Stack

Hard·60 min

Wrap the dynamic array built earlier, or a standard sequential container, in a generic stack. Do not reimplement the backing array.

Provide size, empty, and clear operations.
Implement push, pop, and peek/top while preserving FILO order.
Define explicit underflow behavior for an empty stack.

◀ Previous SectionStacks Next Section ▶Parentheses Matching