Dijkstra's Algorithm
1. Which data structure is best suitable for performing breadth first search?
2. Which data structure is best suitable for performing Depth first search?
3. Given a tree of nodes. We know that the element we want to search is closer to the root node than farther. Which would be the best method to search for it.