OBST explanation

Can ne1 pls explain the Dynamic approach of Optimal Binary Search Tree(OBST)…or maybe give a good link where the algorithm is explained in a systematic manner with a good example!!!

You might find this helpful. Good explanation. Good piece of code. :slight_smile:

You can also refer CLRS, a gem of a book. After that, you might want to refer this code, based on the CLRS’ version

1 Like
  • Optimal BST is explained clearly in the famous book : Introduction to Algorithms by T.H. Cormen.
  • You may also refer to book : Elis Horowitz , which also tries to explain in a nice way.