I dont know how to input the start-information of the tree like this:

A-> B -> C - > D

A-> E -> F

B-> G

C-> G -> H -> I

D-> K

Find the way from A to I by BFS

What data structure i wish to use?? And how to declare it.

Can you give me an example or a shortcut code?

Thanks alot

John