Queue Enqueue/Dequeue

Enqueue values at the back and dequeue them from the front in first-in, first-out order.

Algorithm

The replay uses the same three values in every language, so this Rust DSA implementation can be compared directly with the rest of the DSA track.

Basic Implementation

basic.rs

use std::collections::VecDeque;

fn render(values: &[i32]) -> String {
    values.iter().map(|v| v.to_string()).collect::<Vec<_>>().join(" -> ")
}

fn main() {
    let mut queue = VecDeque::new();
    for value in [10, 20, 30] { queue.push_back(value); }
    let mut removed = Vec::new();
    while let Some(value) = queue.pop_front() { removed.push(value); }
    println!("{}", render(&removed));
}

Complexity

Time: O(1) per operation with a real queue
Space: O(n)

Implementation notes

Keep the explicit stack/queue operations. Library shortcuts that only produce the final list hide the data-structure behavior this lesson is meant to replay.
The final output uses a deterministic a -> b -> c format for cross-language comparison.

front The front is the oldest value still waiting in the queue.

FIFO A queue removes values in first-in, first-out order.