imagine that given binary tree data structure for each left/right branch stores some sort of cost (distance) for you to move along that branch to next node. See image above.

The questions are:

1. Cost (distance) of longest path in tree (a)?
2. Cost (distance) of longest path in tree (b)?
3. Cost (distance) of shortest path in tree (a)?
4. Cost (distance) of shortest path in tree (b)?

What we see is a problem for informed search algorithm (we have cost (distance)). Now which of the problematic spaces we are dealing here with?

5. Which one (a or b) is Telephone Pole space?
6. Which one (a or b) is space with local minimum(-s) (false optimal / sub optimal paths)?

Please dont give any definitions! Just your thoughts.

a) 5 5 5 5 5 5 5 5 5 5 1 5 5 b) 2 1 N 10 1 10 10 2 1 2. 2