explore the dynamic programming method for building an Optimal Binary
Search Tree in C++. Specifically you will design a class (OptimalBST) that, given an array of n keys (int K,
do not assume that K is sorted!) and probabilities, (double P) of each key, builds an Optimal Binary Search
Tree. Note that P[i] denotes the probability of key K[i] (p(ki)). Your function will return a pointer to the
root node of the constructed binary search tree.
I have created a header and source file that you must
use, OptimalBST.h and OptimalBST.cpp.
See the attached files.
Plz do it as soon as poosible.
8 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_26% %project_currencyDetails_sign_sub_27% tähän työhön
I already have an optimal binary search tree Class already developed which i use for my other C++ programming projects. With a bit of modification I easily make it suit your needs.