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