Queue and Stack behavior in C Sharp (C#) - Time & Space Complexity

Time Complexity: Queue and Stack behavior

O(n)

Understanding Time Complexity

We want to understand how the time it takes to add or remove items from queues and stacks changes as we add more items.

How does the number of operations grow when we use these data structures?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

Queue<int> queue = new Queue<int>();
Stack<int> stack = new Stack<int>();

// Add 1000 items
for (int i = 0; i < 1000; i++) {
    queue.Enqueue(i);
    stack.Push(i);
}

// Remove all items
while (queue.Count > 0) {
    queue.Dequeue();
}
while (stack.Count > 0) {
    stack.Pop();
}
    

This code adds 1000 items to both a queue and a stack, then removes all items from each.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Adding and removing items one by one in loops.
• How many times: Each loop runs 1000 times for adding, then 1000 times for removing.

How Execution Grows With Input

When we add or remove more items, the total operations increase directly with the number of items.

Input Size (n)	Approx. Operations
10	About 20 operations (10 adds + 10 removes)
100	About 200 operations (100 adds + 100 removes)
1000	About 2000 operations (1000 adds + 1000 removes)

Pattern observation: The total work grows in a straight line as input size grows.

Final Time Complexity

Time Complexity: O(n)

This means the time to add and remove items grows directly in proportion to how many items there are.

Common Mistake

[X] Wrong: "Removing an item from a queue or stack takes longer as the queue or stack gets bigger."

[OK] Correct: Both queue and stack remove items from one end only, so each remove operation takes the same short time no matter the size.

Interview Connect

Understanding how queues and stacks work with time helps you explain why these structures are efficient for certain tasks, a skill valued in many coding challenges.

Self-Check

"What if we used a list and removed items from the front instead of a queue? How would the time complexity change?"

Practice

1. Which data structure removes elements in the order they were added, like a line at a grocery store?

easy

A. Array

B. Stack

C. Dictionary

D. Queue

Solution

1. Step 1: Understand FIFO behavior

   A queue removes elements in the order they were added, called First-In-First-Out (FIFO).

2. Step 2: Match behavior to real-life example

   A line at a grocery store is FIFO, so the queue matches this behavior.

3. Final Answer:

   Queue -> Option D

4. Quick Check:

   FIFO = Queue [OK]

Hint: FIFO means first in, first out like a queue line [OK]

Common Mistakes:

• Confusing stack with queue
• Thinking stack is FIFO
• Mixing array behavior with queue
• Assuming dictionary has order

2. Which of the following is the correct way to add an item to a Stack in C#?

easy

A. stack.Push(item);

B. stack.Enqueue(item);

C. stack.Add(item);

D. stack.Insert(item);

Solution

1. Step 1: Recall Stack method names

   In C#, Stack uses Push() to add items on top.

2. Step 2: Identify correct method

   Enqueue is for Queue, Add and Insert are not Stack methods.

3. Final Answer:

   stack.Push(item); -> Option A

4. Quick Check:

   Push adds to Stack [OK]

Hint: Use Push() to add to Stack, Enqueue() for Queue [OK]

Common Mistakes:

• Using Enqueue() on Stack
• Using Add() or Insert() which don't exist
• Confusing Stack and Queue methods
• Syntax errors with method calls

3. What is the output of this C# code?

var stack = new Stack<int>();
stack.Push(1);
stack.Push(2);
stack.Push(3);
Console.WriteLine(stack.Pop());
Console.WriteLine(stack.Peek());

medium

A. 3\n2

B. 1\n2

C. 2\n3

D. 3\n3

Solution

1. Step 1: Trace Push operations

   Stack after pushes: bottom=1, middle=2, top=3.

2. Step 2: Execute Pop and Peek

   Pop() removes and returns top (3). Peek() returns new top (2) without removing.

3. Final Answer:

   3\n2 -> Option A

4. Quick Check:

   Pop=3, Peek=2 [OK]

Hint: Pop removes top, Peek shows top without removing [OK]

Common Mistakes:

• Mixing Pop and Peek results
• Assuming FIFO order
• Confusing stack order
• Forgetting Pop removes item

4. Identify the error in this C# code using Queue:

var queue = new Queue<string>();
queue.Push("apple");
queue.Enqueue("banana");
Console.WriteLine(queue.Dequeue());

medium

A. Dequeue() returns last item added

B. Queue does not have Push() method

C. Enqueue() should be Dequeue()

D. Queue cannot store strings

Solution

1. Step 1: Check Queue methods

   Queue uses Enqueue() to add, not Push().

2. Step 2: Identify incorrect method usage

   Calling Push() on Queue causes a compile error.

3. Final Answer:

   Queue does not have Push() method -> Option B

4. Quick Check:

   Queue uses Enqueue, no Push [OK]

Hint: Queue uses Enqueue(), Stack uses Push() [OK]

Common Mistakes:

• Using Push() on Queue
• Confusing Enqueue and Dequeue
• Thinking Dequeue returns last item
• Assuming Queue can't hold strings

5. You want to reverse the order of words in a sentence using C#. Which data structure is best and why?

string sentence = "hello world from C#";

hard

A. Queue, because it keeps original order using FIFO

B. Dictionary, because it stores key-value pairs

C. Stack, because it reverses order using LIFO

D. List, because it sorts items automatically

Solution

1. Step 1: Understand the goal

   Reversing words means last word should come first, so order is reversed.

2. Step 2: Choose data structure behavior

   Stack uses Last-In-First-Out (LIFO), perfect for reversing order.

3. Step 3: Eliminate other options

   Queue keeps order (FIFO), Dictionary stores pairs unordered, List does not reverse automatically.

4. Final Answer:

   Stack, because it reverses order using LIFO -> Option C

5. Quick Check:

   Reverse order = Stack (LIFO) [OK]

Hint: Use Stack to reverse order with LIFO behavior [OK]

Common Mistakes:

• Choosing Queue for reversing
• Thinking List auto-sorts
• Using Dictionary for order
• Ignoring LIFO vs FIFO difference