Queue Implementation Using Linked List in DSA Rust - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a queue in data structures?

A queue is a collection where elements are added at the back and removed from the front, following the First-In-First-Out (FIFO) principle.

beginner

Why use a linked list to implement a queue?

A linked list allows dynamic memory use and efficient insertion and removal at both ends without shifting elements, making it ideal for queue operations.

beginner

In a linked list queue, what do the 'front' and 'rear' pointers represent?

The 'front' pointer points to the first element to be removed, and the 'rear' pointer points to the last element where new elements are added.

intermediate

What happens when you enqueue an element in a linked list queue?

A new node is created and linked at the rear; the rear pointer updates to this new node, and if the queue was empty, front also points to it.

intermediate

What happens when you dequeue an element from a linked list queue?

The node at the front is removed, front pointer moves to the next node, and if the queue becomes empty, rear is set to null.

What principle does a queue follow?

A Last-In-First-Out (LIFO)

B First-In-First-Out (FIFO)

C Random Access

D Priority Based

A queue follows FIFO, meaning the first element added is the first to be removed.

In a linked list queue, where is a new element added?

A At the rear

B Random position

C In the middle

D At the front

New elements are added at the rear of the queue.

What happens to the rear pointer when the last element is dequeued?

A It points to the next node

B It remains unchanged

C It points to the front

D It becomes null

When the queue becomes empty after dequeue, rear is set to null.

Which operation removes an element from the queue?

A Enqueue

B Push

C Dequeue

D Pop

Dequeue removes the front element from the queue.

Why is a linked list preferred over an array for queue implementation?

A Because linked lists allow dynamic size and efficient insertions/removals

B Because linked lists use less memory

C Because arrays are slower to access

D Because linked lists are easier to code

Linked lists allow dynamic size and efficient insertions/removals without shifting elements.

Explain how enqueue and dequeue operations work in a queue implemented using a linked list.

Think about where new nodes are added and removed in the linked list.

Describe the role of front and rear pointers in a linked list queue and what happens when the queue becomes empty.

Consider how these pointers help track the queue ends.

Practice

1. What is the main advantage of implementing a Queue using a linked list instead of an array?

easy

A. Simpler to implement than arrays

B. Faster access to elements by index

C. Dynamic size without fixed capacity limit

D. Uses less memory for small queues

Solution

1. Step 1: Understand queue size behavior

   Arrays have fixed size or require resizing, linked lists grow dynamically.

2. Step 2: Compare memory and resizing

   Linked lists allocate nodes as needed, so no fixed capacity limit exists.

3. Final Answer:

   Dynamic size without fixed capacity limit -> Option C

4. Quick Check:

   Linked list queues grow dynamically = D [OK]

Hint: Linked lists grow dynamically, arrays have fixed size [OK]

Common Mistakes:

• Thinking linked lists allow fast random access
• Assuming arrays use less memory always
• Confusing implementation simplicity

2. Which of the following is the correct Rust syntax to define a node struct for a linked list queue?

easy

A. struct Node { data: i32, next: Option }

B. struct Node { data: i32, next: Node }

C. struct Node { data: i32, next: &Node }

D. struct Node { data: i32, next: Box<Node> }

Solution

1. Step 1: Understand Rust ownership for linked lists

   Rust requires heap allocation for recursive types using Box and Option for nullable links.

2. Step 2: Analyze options

   struct Node { data: i32, next: Option } uses Option which is correct for nullable next pointer; others cause infinite size or borrowing issues.

3. Final Answer:

   struct Node { data: i32, next: Option } -> Option A

4. Quick Check:

   Use Option for nullable next in Rust [OK]

Hint: Use Option for next pointer in Rust linked list [OK]

Common Mistakes:

• Using direct Node type causes infinite size error
• Using references (&Node) without lifetime causes errors
• Omitting Option for nullable next pointer

3. Given the following Rust code snippet for a queue implemented with a linked list, what will be printed after enqueueing 10, 20 and then dequeueing once?

let mut queue = Queue::new();
queue.enqueue(10);
queue.enqueue(20);
let val = queue.dequeue();
println!("Dequeued: {:?}", val);
queue.print();

medium

A. Dequeued: Some(10)
20 -> null

B. Dequeued: Some(20)
10 -> null

C. Dequeued: None
10 -> 20 -> null

D. Dequeued: Some(10)
10 -> 20 -> null

Solution

1. Step 1: Trace enqueue operations

   Enqueue 10 adds node with 10, then enqueue 20 adds node with 20 at the end.

2. Step 2: Trace dequeue operation

   Dequeue removes front node (10), returns Some(10). Remaining queue has 20 only.

3. Final Answer:

   Dequeued: Some(10) 20 -> null -> Option A

4. Quick Check:

   First in first out, dequeue returns 10, queue left with 20 [OK]

Hint: Dequeue removes front, so first enqueued is first out [OK]

Common Mistakes:

• Assuming dequeue removes last element
• Printing queue before dequeue
• Confusing Some and None return values

4. Identify the bug in this Rust enqueue method for a linked list queue:

fn enqueue(&mut self, data: i32) {
    let new_node = Box::new(Node { data, next: None });
    if self.tail.is_none() {
        self.head = Some(new_node);
    } else {
        self.tail.as_mut().unwrap().next = Some(new_node);
    }
    self.tail = Some(new_node);
}

medium

A. Not updating head when queue is empty

B. Using Box instead of Rc for nodes

C. Missing return statement in enqueue

D. Assigning new_node to tail after moving it causes use-after-move error

Solution

1. Step 1: Analyze ownership of new_node

   new_node is moved into head or tail.next, so cannot be moved again.

2. Step 2: Identify use-after-move error

   Assigning self.tail = Some(new_node) after moving new_node causes compile error.

3. Final Answer:

   Assigning new_node to tail after moving it causes use-after-move error -> Option D

4. Quick Check:

   Moving new_node twice causes error [OK]

Hint: Don't move ownership twice; clone or restructure [OK]

Common Mistakes:

• Ignoring Rust ownership rules
• Not updating tail pointer correctly
• Confusing Box and Rc usage

5. You want to implement a method peek for your linked list queue in Rust that returns the front element without removing it. Which approach is correct?

hard

A. Return Option<i32> by cloning data from head node

B. Return Option<&i32> by borrowing data from head node

C. Return i32 directly, panicking if queue is empty

D. Return Option by moving head node

Solution

1. Step 1: Understand peek method goal

   Peek returns front element without removing it, so no ownership transfer.

2. Step 2: Choose correct return type

   Borrowing data with Option<&i32> avoids cloning or moving, safe and efficient.

3. Final Answer:

   Return Option<&i32> by borrowing data from head node -> Option B

4. Quick Check:

   Peek borrows front data, no ownership change [OK]

Hint: Peek borrows front data, don't move or clone unnecessarily [OK]

Common Mistakes:

• Moving head node causing queue modification
• Returning owned data causing unnecessary clone
• Panicking instead of returning Option