Test by Bikram | Algorithms | Test 2 | Question: 30

Question

The cost of optimal binary search 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:

• A. $1.65$
• B. $1.95$
• C. $1.8$
• D. $2.1$

Comments

sir can you please explain this question..

---

@ parulk  

See this PPT Click here   slide number 12

Answer 1

are optimal binary search tree in syllabus or not ?

Comments

Nop! That's why I also skipped this Question ! :(