Peek Front Element of Queue in DSA Python - Time & Space Complexity

Time Complexity: Peek Front Element of Queue

O(1)

Understanding Time Complexity

We want to understand how long it takes to look at the front item in a queue.

Specifically, how does the time needed change as the queue grows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

class Queue:
    def __init__(self):
        self.items = []

    def peek(self):
        if self.items:
            return self.items[0]
        return None
    

This code returns the front element of the queue without removing it.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing the first element of the list self.items[0].
• How many times: This happens once per peek call, no loops or recursion involved.

How Execution Grows With Input

Looking at the front element takes the same amount of time no matter how big the queue is.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The time stays constant even if the queue grows larger.

Final Time Complexity

Time Complexity: O(1)

This means peeking at the front element takes the same short time no matter how many items are in the queue.

Common Mistake

[X] Wrong: "Peeking takes longer if the queue is bigger because it has to look through all items."

[OK] Correct: The code directly accesses the first item by index, so it does not check other items. It is a simple, quick step.

Interview Connect

Knowing that peek is a quick, constant-time operation helps you explain queue behavior clearly in interviews.

Self-Check

"What if the queue was implemented using a linked list instead of a list? How would the time complexity of peek change?"

Practice

1. What does the peek operation do in a queue?

easy

A. Returns the front element without removing it

B. Removes the front element from the queue

C. Adds an element to the back of the queue

D. Checks if the queue is empty

Solution

1. Step 1: Understand the peek operation

   The peek operation looks at the front element of the queue without changing the queue.

2. Step 2: Compare with other operations

   Unlike dequeue, peek does not remove the element; it only returns it.

3. Final Answer:

   Returns the front element without removing it -> Option A

4. Quick Check:

   Peek = front element without removal [OK]

Hint: Peek shows front without removing it [OK]

Common Mistakes:

• Confusing peek with dequeue
• Thinking peek adds elements
• Assuming peek checks emptiness

2. Which of the following is the correct syntax to peek the front element of a queue named q in Python using collections.deque?

easy

A. front = q[0]

B. front = q.peek()

C. front = q.front()

D. front = q.get()

Solution

1. Step 1: Recall deque indexing

   In Python's deque, the front element is accessed by index 0, like q[0].

2. Step 2: Check other options

   Methods peek(), front(), and get() do not exist for deque.

3. Final Answer:

   front = q[0] -> Option A

4. Quick Check:

   deque front element = q[0] [OK]

Hint: Use q[0] to peek front in deque [OK]

Common Mistakes:

• Using non-existent peek() method
• Trying q.front() which is invalid
• Using q.get() which is for other structures

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

from collections import deque
q = deque([10, 20, 30])
print(q[0])
q.popleft()
print(q[0])

medium

A. 30\n20

B. 10\n10

C. 20\n30

D. 10\n20

Solution

1. Step 1: Peek front before removal

   Initially, q = [10, 20, 30], so q[0] is 10.

2. Step 2: Remove front and peek again

   After q.popleft(), q becomes [20, 30], so q[0] is now 20.

3. Final Answer:

   10\n20 -> Option D

4. Quick Check:

   First peek 10, after removal peek 20 [OK]

Hint: Peek before and after popleft to see front change [OK]

Common Mistakes:

• Assuming front stays same after popleft
• Confusing popleft with pop
• Printing wrong elements

4. Identify the error in the following code that tries to peek the front element of a queue:

from queue import Queue
q = Queue()
q.put(5)
q.put(10)
print(q[0])

medium

A. print statement syntax error

B. Queue is empty, cannot peek

C. Queue object does not support indexing

D. put() method is incorrect

Solution

1. Step 1: Understand Queue class behavior

   Python's queue.Queue does not support direct indexing like q[0].

2. Step 2: Identify correct peek method

   To peek, one must use q.queue[0] or other methods, but direct q[0] causes error.

3. Final Answer:

   Queue object does not support indexing -> Option C

4. Quick Check:

   queue.Queue no indexing [OK]

Hint: queue.Queue objects can't use q[0] indexing [OK]

Common Mistakes:

• Trying to index queue.Queue directly
• Assuming put() is wrong
• Thinking queue is empty

5. You have a queue implemented using a list in Python: q = [5, 10, 15]. You want to peek the front element safely without causing an error if the queue is empty. Which code snippet correctly does this?

hard

A. front = q.pop(0)

B. front = q[0] if len(q) > 0 else None

C. front = q[-1]

D. front = q.get()

Solution

1. Step 1: Check for empty queue before peeking

   Accessing q[0] when q is empty causes error, so check length first.

2. Step 2: Understand other options

   pop(0) removes element, not peek; q[-1] accesses last element; q.get() is invalid for list.

3. Final Answer:

   front = q[0] if len(q) > 0 else None -> Option B

4. Quick Check:

   Safe peek with length check [OK]

Hint: Check length before accessing q[0] to avoid errors [OK]

Common Mistakes:

• Using pop(0) which removes element
• Accessing q[0] without checking empty
• Using q.get() on list