Obtain the optimal binary search tree with equal probabilities for the identifier set (a₁, a₂, a₃) = ( if, stop, while)

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 ______