DFS with Preorder, Inorder, and Postorder Traversals (for Binary Trees): These traversals define the order in which the current node is processed relative to its children.

Thus we will be able to get the route from a node to another node using BFS and DFS. Further modifications can be made to assign real world places as nodes to make this work in real world.