Register

Optimal binary search tree

1,256 views
1 votes
1 votes
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?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
`JEET asked Jan 19, 2019
473 views
Is there any good content available online for OPTIMAL BINARY SEARCH TREE? Preferably Videos.
Suggestions on good content for Optimal Binary Search Tree.
Suggestions on good content for Optimal Binary Search Tree.
User Avatar
0 votes
0 votes
1 answer
3
supraja asked Apr 28, 2015
4,264 views
Optimal binary search tree
Given the following table of data what are the minimum expected no.of comparisons required for an Optimal i 0 1 2 3 4 Pi 3/16 3/16 1/16 1/16 Qi 2/16 3/16 1/16 1/16 1/16 BST that can be constructed with the given data
Given the following table of data what are the minimum expected no.of comparisons required for an Optimali01234Pi 3/163/161/161/16Qi2/163/161/161/161/16BST that can be co...
User Avatar
0 votes
0 votes
1 answer
4
Banti Arya asked Jan 30, 2016
10,040 views
optimal binary serch tree
The cost of optimal binary serch tree for the identifier set (a1,a2,a3) = (do , if , while ) with p(1) =0.3,p(2) =0.2, p(3) = 0.15, q(0) = 0.05,q(1) = 0.15,q(2) =0.1,q(3) =0.05 is ?
The cost of optimal binary serch tree for the identifier set (a1,a2,a3) = (do , if , while ) with p(1) =0.3,p(2) =0.2, p(3) = 0.15, q(0) = 0.05,q(1) = 0.15...
User Avatar
Link Copied!