Course contentsShow
← Java
Lesson 1168 of 2,87027. Queue and Deque ImplementationsFree lesson

Queue Core Methods: add, offer, remove, poll

Learn the primary insertion and removal methods and how they differ in exception handling.

Queue Core Methods: add, offer, remove, poll

What you'll learn: You'll understand the four fundamental Queue methods and how they handle success and failure differently.

Two Ways to Do Everything

The Queue interface provides two methods for insertion and two methods for removal—the difference is how they handle failure.

Insertion methods:

  • add(element) — Adds an element to the queue. If the queue is full (capacity-restricted queues), it throws IllegalStateException.
  • offer(element) — Adds an element to the queue. If the queue is full, it returns false instead of throwing an exception.

Removal methods:

  • remove() — Removes and returns the head element. If the queue is empty, it throws NoSuchElementException.
  • poll() — Removes and returns the head element. If the queue is empty, it returns null instead of throwing an exception.

Why Two Versions?

Think of it like a busy restaurant:

  • Exception-throwing methods (add, remove) are like demanding customers: "I MUST get a table now, or I'm complaining to the manager!" They fail loudly.
  • Return-value methods (offer, poll) are polite: "Is there a table available? No? Okay, I'll check back later." They fail gracefully.

For unbounded queues (no capacity limit), add and offer behave identically—both succeed. But for bounded queues or when checking if removal is possible, the distinction matters.

When to Use Which

Use add/remove when failure is exceptional and should stop your program flow. Use offer/poll when you want to handle failure gracefully without exceptions.

Key Takeaway: Queue provides paired methods for insertion (add/offer) and removal (remove/poll)—the exception-throwing versions for when failure is critical, and the return-value versions for graceful handling.