Why Stack Exists and What Problems It Solves in DSA Rust - Why This Pattern

Mental Model

A stack is a simple way to keep track of things in order, where the last thing you put in is the first thing you take out.

Analogy: Imagine a stack of plates in your kitchen: you always put a new plate on top and take the top plate off first. This helps you manage plates without mixing them up.

Top
 ↑
[Plate3]
[Plate2]
[Plate1]
Bottom

Dry Run Walkthrough

Input: Push plates 1, 2, 3 onto the stack, then pop one plate off

Goal: Show how the last plate added is the first one removed, solving the problem of tracking order easily

Step 1: Push plate 1 onto the empty stack

Top
 ↑
[Plate1]
Bottom

Why: We start by adding the first plate to the stack

Step 2: Push plate 2 on top of plate 1

Top
 ↑
[Plate2]
[Plate1]
Bottom

Why: New plates go on top, so plate 2 is now on top of plate 1

Step 3: Push plate 3 on top of plate 2

Top
 ↑
[Plate3]
[Plate2]
[Plate1]
Bottom

Why: Plate 3 is the newest, so it goes on top

Step 4: Pop the top plate off (plate 3)

Top
 ↑
[Plate2]
[Plate1]
Bottom

Why: We remove the last plate added, showing last-in-first-out order

Result:

Top
 ↑
[Plate2]
[Plate1]
Bottom
Popped plate: Plate3

Annotated Code

DSA Rust

struct Stack<T> {
    elements: Vec<T>,
}

impl<T> Stack<T> {
    fn new() -> Self {
        Stack { elements: Vec::new() }
    }

    fn push(&mut self, item: T) {
        self.elements.push(item); // add item on top
    }

    fn pop(&mut self) -> Option<T> {
        self.elements.pop() // remove and return top item
    }

    fn print_stack(&self) {
        println!("Top");
        println!(" ↑");
        for elem in self.elements.iter().rev() {
            println!("[{}]", elem);
        }
        println!("Bottom");
    }
}

fn main() {
    let mut stack = Stack::new();
    stack.push("Plate1");
    stack.push("Plate2");
    stack.push("Plate3");
    stack.print_stack();

    if let Some(popped) = stack.pop() {
        println!("Popped plate: {}", popped);
    }
    stack.print_stack();
}

self.elements.push(item); // add item on top

push new element on top of stack

self.elements.pop() // remove and return top item

pop top element from stack

for elem in self.elements.iter().rev() { println!("[{}]", elem); }

print stack from top to bottom

Output

Top

 ↑

[Plate3]

[Plate2]

[Plate1]

Bottom

Popped plate: Plate3

Top

 ↑

[Plate2]

[Plate1]

Bottom

Complexity Analysis

Time: O(1) for push and pop because adding or removing the top element is direct

Space: O(n) because the stack stores all pushed elements

vs Alternative: Compared to arrays where removing last element is O(1) but removing first is O(n), stack always removes from top in O(1)

Edge Cases

Pop from empty stack

Returns None safely without error

DSA Rust

self.elements.pop() // remove and return top item

When to Use This Pattern

When you need to remember things in reverse order or undo actions, use a stack because it naturally handles last-in-first-out order.

Common Mistakes

Mistake: Trying to pop from an empty stack without checking
Fix: Use Option type to safely handle empty stack pop

Summary

A stack stores items so the last added is the first removed.

Use it when you need to reverse order or track recent actions.

The key insight is last-in-first-out order, like a stack of plates.

Practice

1. Why do we use a stack data structure in programming?

easy

A. To keep track of function calls and return addresses

B. To store data in random order

C. To sort elements automatically

D. To store large amounts of data permanently

Solution

1. Step 1: Understand the role of stack in function calls

   Stacks help keep track of where each function should return after it finishes executing, by storing return addresses.

2. Step 2: Compare with other options

   Stacks do not sort data automatically, nor store data randomly or permanently; their main use is managing function calls.

3. Final Answer:

   To keep track of function calls and return addresses -> Option A

4. Quick Check:

   Stack = function call tracking [OK]

Hint: Stack remembers last function called first [OK]

Common Mistakes:

• Thinking stack sorts data automatically
• Confusing stack with permanent storage
• Assuming stack stores data randomly

2. Which of the following is the correct way to push an element onto a stack in Rust using a vector?

easy

A. stack.insert(element);

B. stack.add(element);

C. stack.append(element);

D. stack.push(element);

Solution

1. Step 1: Recall Rust vector methods for stack operations

   In Rust, a vector's push() method adds an element to the end, simulating stack push.

2. Step 2: Check other options for correctness

   Methods add(), insert(), and append() do not exist or do not behave like push() for stack usage.

3. Final Answer:

   stack.push(element); -> Option D

4. Quick Check:

   Use push() to add element to stack [OK]

Hint: Use push() to add on top of stack [OK]

Common Mistakes:

• Using add() which is not a Rust Vec method
• Confusing insert() which needs index
• Using append() which merges vectors

3. What will be the output of the following Rust code snippet?

let mut stack = Vec::new();
stack.push(10);
stack.push(20);
let top = stack.pop();
println!("{:?}", top);

medium

A. Some(20)

B. Some(10)

C. 20

D. None

Solution

1. Step 1: Trace stack push operations

   First 10 is pushed, then 20 is pushed. Stack now has [10, 20].

2. Step 2: Understand pop() behavior

   pop() removes and returns the last element, which is 20, wrapped in Some(20) because pop returns Option.

3. Final Answer:

   Some(20) -> Option A

4. Quick Check:

   pop() returns last element wrapped in Some [OK]

Hint: pop() returns Option with last pushed element [OK]

Common Mistakes:

• Expecting pop() to return raw value, not Option
• Confusing order of elements pushed
• Thinking pop() returns None when stack is not empty

4. Identify the error in this Rust code that uses a stack:

let mut stack = Vec::new();
let top = stack.pop().unwrap();
println!("{}", top);

medium

A. println! macro syntax is incorrect

B. Calling unwrap() on empty stack causes panic

C. stack should be immutable

D. pop() method does not exist on Vec

Solution

1. Step 1: Analyze pop() on empty vector

   pop() returns None if vector is empty. Calling unwrap() on None causes panic (runtime error).

2. Step 2: Check other options for validity

   pop() exists on Vec, stack is mutable, and println! syntax is correct.

3. Final Answer:

   Calling unwrap() on empty stack causes panic -> Option B

4. Quick Check:

   unwrap() on None panics [OK]

Hint: Never unwrap pop() without checking empty [OK]

Common Mistakes:

• Ignoring possibility of empty stack
• Thinking pop() is undefined on Vec
• Assuming println! syntax is wrong

5. You want to reverse a list of integers using a stack in Rust. Which approach correctly uses a stack to reverse the list?

let list = vec![1, 2, 3, 4];
let mut stack = Vec::new();
// Fill stack
for &item in &list {
    stack.push(item);
}
// Extract reversed list
let mut reversed = Vec::new();
while let Some(val) = stack.pop() {
    reversed.push(val);
}
println!("{:?}", reversed);

hard

A. Stack is not needed; list.reverse() is better

B. pop() should be replaced with peek() to reverse

C. This code correctly reverses the list using a stack

D. The code will panic because stack is empty

Solution

1. Step 1: Understand pushing all elements onto stack

   Each element from list is pushed onto stack in order: 1,2,3,4.

2. Step 2: Popping elements reverses order

   pop() removes last pushed element first, so reversed vector gets 4,3,2,1.

3. Step 3: Confirm no panic occurs

   while let Some(val) safely handles empty stack, no panic occurs.

4. Final Answer:

   This code correctly reverses the list using a stack -> Option C

5. Quick Check:

   Stack pop reverses order [OK]

Hint: Push all, then pop all to reverse [OK]

Common Mistakes:

• Replacing pop() with peek() which doesn't remove
• Assuming code panics on empty stack
• Ignoring that stack reverses order naturally