Add Optimal binary serach tree

[MeenuyD]

The runtime complexity of constructing an optimal binary search tree using dynamic programming is O(n^3), where n is the number of keys. Optimal Binary Search Trees are particularly useful when the keys have different probabilities of being accessed during searches. I would like to work on this please assign it to me under SSOC'23