GATE CS 2018 - Algorithms Quiz 8 (Graphs)

A binary search tree contains the numbers 1,2,3,4,5,6,7,8. When the tree is traversed in pre-order and the values in each node printed out, the sequence of values obtained is 5,3,1,2,4,6,8,7.. If the tree is traversed in post-order, the sequence obtained would be.

It is observed that in unweighted graph, shortest path from node S to every node is calculated in terms of time complexity. So, by which of the following process, time complexity can be obtained?

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph if Q is starting node.