Why Stack Exists and What Problems It Solves in DSA Rust - Performance Analysis

Time Complexity: Why Stack Exists and What Problems It Solves

O(1)

Understanding Time Complexity

We want to understand why the stack data structure is useful and how fast it works for common tasks.

What question are we trying to answer? How quickly can we add, remove, or check items using a stack?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

struct Stack {
    items: Vec,
}

impl<T> Stack<T> {
    fn push(&mut self, item: T) {
        self.items.push(item);
    }

    fn pop(&mut self) -> Option<T> {
        self.items.pop()
    }

    fn peek(&self) -> Option<&T> {
        self.items.last()
    }
}
    

This code defines a stack with push, pop, and peek operations using a vector.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Adding or removing an item at the end of the vector (push/pop).
• How many times: Each push or pop happens once per call, no loops inside these methods.

How Execution Grows With Input

Each push or pop takes about the same time no matter how many items are in the stack.

Input Size (n)	Approx. Operations per push/pop
10	1
100	1
1000	1

Pattern observation: The time to add or remove an item stays constant even as the stack grows.

Final Time Complexity

Time Complexity: O(1)

This means adding or removing an item from the stack takes the same short time no matter how many items are inside.

Common Mistake

[X] Wrong: "Removing an item from the stack takes longer as the stack grows because it has more items."

[OK] Correct: The stack only adds or removes items at one end, so it does not need to look through all items. Each operation is quick and does not depend on stack size.

Interview Connect

Understanding stack operations and their constant time behavior helps you explain why stacks are great for tasks like undo features, parsing, and managing function calls.

Self-Check

"What if we changed the stack to add and remove items from the start of the vector? How would the time complexity change?"

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