Computer Science · Artificial Intelligence
If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy best-first search?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(b + m)
- 2O(bm)
- 3O(bm)✓
- 4O(mb)
Correct answer
O(bm)
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
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Artificial Intelligence MCQs →Want more practice questions on Artificial Intelligence?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Artificial Intelligence