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(b^m)

(D)

O(m^m)

Answer: (C)
Explanation:

1. In binary tree branching factor is 2 and space complexity for height n is O(2ⁿ).
2. In ternary tree branching factor is 3 and space complexity for height n is O(3ⁿ).
3. If branching factor is b and height is m for search tree then space complexity of greedy search is O(b^m).

So, option (C) is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post