Peek Front Element of Queue in DSA Python

Mental Model

A queue is like a line where the first person in line is the next to be served. Peeking means looking at that first person without removing them.

Analogy: Imagine waiting in line at a coffee shop. Peeking is like glancing at the person at the front of the line to see who will be served next, without letting them leave the line.

front -> [1] -> 2 -> 3 -> null
          ↑peek

Dry Run Walkthrough

Input: queue: 1 -> 2 -> 3, peek front element

Goal: To see the value of the front element without removing it from the queue

Step 1: Access the front pointer of the queue

front -> [1] -> 2 -> 3 -> null
          ↑peek

Why: We need to look at the first element to know what is at the front

Step 2: Read the value at the front node

front -> [1] -> 2 -> 3 -> null
          ↑peek

Why: Reading the value gives us the front element without changing the queue

Result:

front -> 1 -> 2 -> 3 -> null
peeked value = 1

Annotated Code

DSA Python

class Node:
    def __init__(self, value):
        self.value = value
        self.next = None

class Queue:
    def __init__(self):
        self.front = None
        self.rear = None

    def enqueue(self, value):
        new_node = Node(value)
        if not self.rear:
            self.front = self.rear = new_node
            return
        self.rear.next = new_node
        self.rear = new_node

    def peek(self):
        if not self.front:
            return None
        return self.front.value

    def __str__(self):
        result = []
        current = self.front
        while current:
            result.append(str(current.value))
            current = current.next
        return ' -> '.join(result) + ' -> null'

# Driver code
queue = Queue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
print(queue)
print("Peeked value =", queue.peek())

if not self.front:

check if queue is empty to avoid errors

return self.front.value

return the value at the front without removing it

Output

1 -> 2 -> 3 -> null

Peeked value = 1

Complexity Analysis

Time: O(1) because peeking only reads the front element without traversal

Space: O(n) because the queue stores n elements; peek uses no extra space

vs Alternative: Peeking is faster than dequeue which removes the element; peek does not change the structure

Edge Cases

empty queue

peek returns None indicating no front element

DSA Python

if not self.front:

When to Use This Pattern

When you need to check the next item to process without removing it, use the peek operation on a queue.

Common Mistakes

Mistake: Trying to peek when the queue is empty without checking causes errors
Fix: Always check if the front is None before accessing its value

Summary

Peek returns the value at the front of the queue without removing it.

Use peek when you want to see the next element to be processed without changing the queue.

The key insight is that peek reads the front pointer's value without modifying the queue structure.

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