Nov2017 cs Q56 Multiple Choice Questions

Option : 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.