Peek Front Element of Queue in DSA Rust

Mental Model

A queue lets you see the first item waiting without removing it. Peeking means looking at the front without changing the queue.

Analogy: Imagine a line at a coffee shop. Peeking is like glancing at the first person in line to see who's next without letting them order yet.

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

Dry Run Walkthrough

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

Goal: See the first element (1) without removing it from the queue

Step 1: Access the front element of the queue

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

Why: We need to look at the first element to peek

Step 2: Return the value of the front element (1)

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

Why: Peeking returns the front value without removing it

Result:

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

Annotated Code

DSA Rust

use std::collections::VecDeque;

struct Queue<T> {
    data: VecDeque<T>,
}

impl<T> Queue<T> {
    fn new() -> Self {
        Queue { data: VecDeque::new() }
    }

    fn enqueue(&mut self, value: T) {
        self.data.push_back(value);
    }

    fn peek(&self) -> Option<&T> {
        self.data.front() // return reference to front element
    }

    fn print(&self) {
        for val in &self.data {
            print!("{} -> ", val);
        }
        println!("null");
    }
}

fn main() {
    let mut queue = Queue::new();
    queue.enqueue(1);
    queue.enqueue(2);
    queue.enqueue(3);

    queue.print();

    match queue.peek() {
        Some(front) => println!("peeked value: {}", front),
        None => println!("queue is empty"),
    }
}

self.data.front() // return reference to front element

access front element without removing it to peek

queue.enqueue(1); queue.enqueue(2); queue.enqueue(3);

add elements to queue to set up example

queue.print();

show current queue state

match queue.peek() { ... }

retrieve and print front element safely

Output

1 -> 2 -> 3 -> null

peeked value: 1

Complexity Analysis

Time: O(1) because peeking accesses the front element directly without traversal

Space: O(n) for storing n elements in the queue, peeking uses no extra space

vs Alternative: Compared to dequeuing which removes the element, peeking is faster as it does not modify the structure

Edge Cases

empty queue

peek returns None indicating no front element

DSA Rust

match queue.peek() { Some(front) => ..., None => println!("queue is empty") }

When to Use This Pattern

When you need to check the next item to process without removing it, use the peek pattern to avoid changing the queue state.

Common Mistakes

Mistake: Removing the front element instead of just peeking
Fix: Use a method that returns a reference to the front element without popping it, like VecDeque::front()

Summary

Peek shows the first element in the queue without removing it.

Use peek when you want to see the next item but keep it in line.

The key is accessing the front element directly without changing the queue.

Practice

1. What does the peek() method do in a queue data structure?

easy

A. Adds a new element to the back of the queue

B. Returns the front element without removing it

C. Removes the front element from the queue

D. Checks if the queue is empty

Solution

1. Step 1: Understand the purpose of peek()

   The peek() method is used to look at the front element of the queue without changing the queue.

2. Step 2: Differentiate peek() from other queue operations

   Unlike dequeue which removes the front element, peek() only returns it without removal.

3. Final Answer:

   Returns the front element without removing it -> Option B

4. Quick Check:

   peek() = front element [OK]

Hint: Peek means look without removing [OK]

Common Mistakes:

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

2. Which of the following is the correct Rust syntax to peek the front element of a VecDeque named queue?

easy

A. let front = queue.front();

B. let front = queue.peek_front();

C. let front = queue.peek();

D. let front = queue[0];

Solution

1. Step 1: Recall VecDeque front method

   In Rust, VecDeque provides front() to look at the front element without removing it.

2. Step 2: Check other options

   peek_front() and peek() are not valid VecDeque methods; queue[0] is invalid because VecDeque does not implement Index<usize>.

3. Final Answer:

   let front = queue.front(); -> Option A

4. Quick Check:

   VecDeque peek front = front() [OK]

Hint: Use front() to peek front in VecDeque [OK]

Common Mistakes:

• Using peek_front() which does not exist on VecDeque
• Using peek() which does not exist
• Trying queue[0] without Index implementation

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

use std::collections::VecDeque;

fn main() {
    let mut queue = VecDeque::new();
    queue.push_back(10);
    queue.push_back(20);
    queue.push_back(30);
    if let Some(front) = queue.front() {
        println!("{}", front);
    }
}

medium

A. 10

B. 20

C. 30

D. None

Solution

1. Step 1: Understand queue contents after push_back

   Elements added in order: 10 (front), 20, 30 (back).

2. Step 2: Peek front element

   front() returns reference to 10, the first element.

3. Final Answer:

   10 -> Option A

4. Quick Check:

   Front element = 10 [OK]

Hint: front() returns first pushed element [OK]

Common Mistakes:

• Confusing front() with pop_front()
• Expecting last element instead of first
• Ignoring Option handling with if let

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

use std::collections::VecDeque;

fn main() {
    let mut queue = VecDeque::new();
    queue.push_back(5);
    let front = queue.peek();
    println!("{}", front.unwrap());
}

medium

A. Cannot unwrap Option returned by peek()

B. push_back() does not add elements

C. VecDeque has no method named peek()

D. println! macro syntax is incorrect

Solution

1. Step 1: Check VecDeque methods

   VecDeque does not have a method named peek(); it uses front() to peek front element.

2. Step 2: Analyze other parts

   push_back() correctly adds elements; unwrap() is valid if Option is Some; println! syntax is correct.

3. Final Answer:

   VecDeque has no method named peek() -> Option C

4. Quick Check:

   peek() method missing in VecDeque [OK]

Hint: Use front(), not peek(), on VecDeque [OK]

Common Mistakes:

• Using peek() instead of front()
• Ignoring method availability in VecDeque
• Assuming unwrap() always safe without checking

5. You have a queue implemented using VecDeque in Rust. You want to peek the front element safely and print it or print "Empty" if the queue is empty. Which code snippet correctly does this?

hard

A. if queue.is_empty() { println!("Empty"); } else { println!("{}", queue.pop_front().unwrap()); }

B. println!("{}", queue.front().unwrap());

C. println!("{}", queue[0]);

D. if let Some(front) = queue.front() { println!("{}", front); } else { println!("Empty"); }

Solution

1. Step 1: Understand safe peek usage

   front() returns Option<&T>. Using if let Some(front) safely handles empty queue.

2. Step 2: Check other options

   The unwrap version panics if empty (unsafe), direct indexing is invalid on VecDeque, the version with pop_front() removes the element instead of peeking.

3. Final Answer:

   if let Some(front) = queue.front() { println!("{}", front); } else { println!("Empty"); } -> Option D

4. Quick Check:

   Safe peek with if let Some(front) = queue.front() { println!("{}", front); } else { println!("Empty"); } [OK]

Hint: Use if let Some(front) = front() for safe peek [OK]

Common Mistakes:

• Unwrapping Option without checking
• Using pop_front() instead of front()
• Indexing VecDeque like a vector