You are given binary tree data structure $($binary tree means each tree node have at most $2$ child branches $($left & right$),$ or it can have zero branches which means we are dealing with tree leaf$).$

Your goal is to find route to specific node.

$1)$ If you know that your tree is potentially infinite $-$ which type$(-$s$)$ of search you can choose? Why?

a$)$ Depth$-$First

b$)$ Breadth$-$First

c$)$ Depth$-$First with Depth Limit

d$)$ Iterative Deepening Depth First Search

e$)$ Bidirectional search

For selection you$$ve chosen above $-$ additional questions:

f$)$ Can we add backtracking? Why?

g$)$ Can we use Enqued List? Why?

Please don$$t give any definitions! Just your thoughts.

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

See next page for next question...

Next scenario $-$ 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 don$$t give any definitions! Just your thoughts.

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Next question on next page....

Now imagine next situation:

So the questions are:

$1)$ For image $($a$)-$ which is global optimum path?

$2)$ For image $($a$)-$ is selected heuristics Ok$?$

$3)$ For image $($b$)-$ which is global optimum path?

$4)$ For image $($b$)-$ is selected heuris