38 Optimal Binary Search Tree (OBST) Successful Search Probability Only using Dynamic Programming

Optimal Binary Search Tree (OBST) Successful Search Probability Only, The number of sorted keys are {A, B, C, D}, and its probability values are 0.1, 0.2, 0.4, and 0.3 respectively. Build an OBST for these given keys.