rahulrajcse

How to solve monkey and banana problem using best-first search algorithm? Anyone having ideas? I know we have to choose a heuristic function 'h(n)' for performing distance related calculations. But can anyone elaborate this problem ? (algorithm and complexity analysis much appreciated)

Can anyone say "which is the best data-structure that is implemented successfully?" (in terms of complexity & applicability)