View Categories

What are the differences between a List and a Queue in Dart?

Parthiban Kannan
Updated on December 6, 2025

1 min read

In Dart, both List and Queue are used to store collections of elements, but they differ mainly in how elements are accessed, inserted, and removed — and in the use cases they’re designed for.

A List is an indexed collection — meaning every element has a specific position (index), and you can access any element directly using its index.
On the other hand, a Queue is a collection designed for sequential processing, typically following FIFO (First In, First Out) order.

Here’s a simple example to highlight the difference:

📄
filename.dart 
import 'dart:collection';

void main() {
  // List example
  List numbers = [10, 20, 30];
  numbers.add(40);
  print(numbers[1]); // Access by index → 20
  numbers.removeAt(0); // Remove by index

  // Queue example
  Queue queue = Queue();
  queue.addAll(['A', 'B', 'C']);
  queue.add('D');
  print(queue.removeFirst()); // Removes the first element → 'A'
  print(queue); // Remaining → (B, C, D)
}

So in this case:

  • List allows random access (direct indexing)
  • Queue focuses on sequential operations (adding/removing from ends)

I’ve used Lists in most UI-related tasks — for example, managing a list of items in a ListView.
But I used Queues in cases where order and processing sequence were important — like when I implemented a task queue for background uploads, where each task should be processed one by one in the same order.

A challenge I faced with Queues was that they don’t support index-based access, so if I needed to check or modify an element in the middle, I had to convert it to a list or iterate manually — which is less efficient.

Limitations:

  • List can become inefficient for frequent insertions/removals at the beginning (since elements must shift positions).
  • Queue doesn’t allow direct random access.

Alternatives:
If I need both behaviors — fast insert/remove and random access — I sometimes use LinkedList from dart:collection for more control, or simply rely on List with careful indexing when order processing isn’t strict.

In short,

Use List when you need index-based access and flexible data manipulation.
Use Queue when you need ordered processing like “first in, first out.”

Scroll to Top