0 votes 0 votes 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: $1.65$ $1.95$ $1.8$ $2.1$ Algorithms tbb-algorithms-2 + – Bikram asked May 26, 2017 • edited Aug 20, 2019 by Counsellor Bikram 505 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply parulk commented Jul 11, 2017 i edited by parulk Jul 12, 2017 reply Follow Share sir can you please explain this question.. 0 votes 0 votes Bikram commented Jul 11, 2017 i edited by Bikram Jul 11, 2017 reply Follow Share @ parulk See this PPT Click here slide number 12 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes are optimal binary search tree in syllabus or not ? Aman Bisht 1 answered Oct 7, 2017 Aman Bisht 1 comment Share Follow See 1 comment See all 1 1 comment reply Ashwin Kulkarni commented Nov 6, 2017 reply Follow Share Nop! That's why I also skipped this Question ! :( 0 votes 0 votes Please log in or register to add a comment.