Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with n vertices and m edges has the time complexity of:

Minimum number of comparisons required to sort 5 elements

If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______

The following sequence of operations is performed on stack: PUSH (10),PUSH (20),POP,PUSH (10),PUSH (20),POP,POP,POP,PUSH (20),POP The sequence of the value popped out is: