UGC-NET | UGC-NET CS 2017 Nov – III | Question 56

If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
(A) O(b+m)
(B) O(bm)
(C) O(bm)
(D) O(mm)

Answer: (C)


  1. In binary tree branching factor is 2 and space complexity for height n is O(2n).
  2. In ternary tree branching factor is 3 and space complexity for height n is O(3n).
  3. Similarly

  4. If branching factor is b and height is m for search tree then space complexity of greedy search is O(bm).

So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.