0 votes 0 votes 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 ? Banti Arya asked Jan 30, 2016 Banti Arya 10.0k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Avdhesh Singh Rana commented Jan 30, 2016 reply Follow Share what are p and q? 0 votes 0 votes Banti Arya commented Jan 30, 2016 reply Follow Share not given 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes part 1 gshivam63 answered Jun 10, 2016 gshivam63 comment Share Follow See all 3 Comments See all 3 3 Comments reply gshivam63 commented Jun 10, 2016 reply Follow Share part 2 0 votes 0 votes gshivam63 commented Jun 10, 2016 reply Follow Share Part 3 0 votes 0 votes Bikram commented Jul 11, 2017 reply Follow Share see this click this PPT slide number 12 1 votes 1 votes Please log in or register to add a comment.