Read $10\mathrm{.}4\mathrm{.}2$ Traversals of Binary Trees

How are traversals of binary trees different than graph traversals $($e$.$g$.$ paths and circuits studied in ch $9)?$

Question $2$ options:

consecutive vertices that are visited are not always connected with an edge

consecutive edges that are visited are always connected with a vertex

consecutive vertices that are visited are always connected with an edge