A

Admin • 828.03K Points
Coach

Q. Which Java collection is best for implementing a breadth-first search?

  • (A) Stack
  • (B) Queue
  • (C) Set
  • (D) TreeMap
Explanation by: Admin
A Queue is ideal for implementing BFS because of its FIFO structure.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.