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.
I need this project in 5-6 hours.
7 freelance ont fait une offre moyenne de 79 $ pour ce travail
Hi, We have a team of experienced professional programmers, the leader of the team has a Master degree in Computer Systems emphasis on .NET programming. We are sure we can assist you completing your project on time.