Computer Science · Graph Traversals
Which of the following data structures is most useful in traversing a given graph by Breadth-First Search (BFS)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Queue✓
- 2List
- 3Set
- 4Stack
Correct answer
Queue
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Traversals MCQs →Want more practice questions on Graph Traversals?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Traversals