Question

Prim's algorithm to find mst is analogous to level order traversal of a binary tree

Answer 1

in order traversal .In this traversal method ,the left subtree is visited first,then the root and later the right subtree