A

Admin • 833.24K Points
Coach

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

  • (A) Stack
  • (B) Queue
  • (C) Set
  • (D) TreeMap
  • Correct Answer - Option(B)
  • Views: 22
  • Filed under category Java
  • Hashtags: Java Queue

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.