Optimal Binary Search Trees

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 [url removed, login to view]


See more: use binary search tree, trees search, trees c, tree node, tree binary search, sorted binary tree, search trees, search programming, search binary tree, search binary, search tree, programming method, programming binary, programming function keys, probability programming, pointer programming, optimal design, node tree, int i, dynamic programming method, dynamic p, double programming, programming pointer, cpp return array, cpp array

About the Employer:
( 0 reviews ) Lincoln, United States

Project ID: #9074