Computer Science · Search Algorithms
Which data structure is most suitable for uniform-cost search?
- 1Stack
- 2Queue
- 3Double-ended Queue (Deque)
- 4Priority Queue✓
Correct answer
Priority 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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Search Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Search Algorithms