Q: If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
I HAVE A DOUBT THAT IIN SOLUTION THE SPACE COMPLEXITY OF BINARY TREE OF HEIGHT N IS GIVEN AS O(2n ) as i know the space complexity is something equal to number of levels .....