in short: dijkstra is like BFS, but instead of a queue, we use a priority queue to always expand the node with the smallest current distance.
From basic traversals to complex dynamic programming solutions, trees can be found everywhere, yes even in your interviews.