$ruthi
asked
Nov 12, 2017
1,274
views
Optimal binary search tree
Let n=4, and (a1,a2,a3,a4) =(do,if,int,while). Let p (1••••••4) = (3,3,1,1) and q ( 0••••4) =(2,3,1,1,1). If you construct optimal cost binary search tree then what is the cost of the optimal binary search tree? And which is the root in the optimal cost binary search tree?
Let n=4, and (a1,a2,a3,a4) =(do,if,int,while).Let p (1••••••4) = (3,3,1,1) and q ( 0••••4) =(2,3,1,1,1). If you construct optimal cost binary search t...
