1 votes 1 votes Consider the following instance of OBST (Optimal Binary Search Tree) Problem. n=4;<a1,a2,a3,a4>=<do,if,int,while> P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1> The Cost of OBST(optimal binary search tree) is________ DS data-structures binary-search-tree ace-test-series numerical-answers + – talha hashim asked Aug 17, 2018 recategorized Jul 6, 2022 by Lakshman Bhaiya talha hashim 602 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes answer is 40. Kindly find the proof here mmrxyz answered Nov 27, 2018 mmrxyz comment Share Follow See all 3 Comments See all 3 3 Comments reply vikashbit055 commented Dec 15, 2018 reply Follow Share Ans is given 32 ? 0 votes 0 votes mmrxyz commented Dec 15, 2018 reply Follow Share I don't remember what was the answer given, but it was definitely wrong. I think the answer given was 32 0 votes 0 votes Pika commented Sep 17, 2019 reply Follow Share Is there any formula to find the cost of optimal bst.I find this lengthy 0 votes 0 votes Please log in or register to add a comment.