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?
   1. Depth-First
   2. Breadth-First
   3. Depth-First with Depth Limit
   4. Iterative Deepening Depth First Search
   5. Bidirectional search

For selection youve chosen above - additional questions:

6. Can we add backtracking? Why?
7. Can we use Enqued List? Why?

Please dont give any definitions! Just your thoughts.