Follow Us :

Nov2017 cs Q56

0. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

  • Option : C
  • Explanation :
    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. 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.
Cancel reply
Cancel reply