1
GATE CSE 1991
Subjective
+2
-0
Obtain the optimal binary search tree with equal probabilities for the identifier set (a1, a2, a3) = ( if, stop, while)
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP