Optimal Binary Search in C++

Cerrado Publicado Dec 2, 2004 Pagado a la entrega
Cerrado Pagado a la entrega

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.

Programación en C

Nº del proyecto: #9126

Sobre el proyecto

7 propuestas Proyecto remoto Activo Nov 26, 2006

7 freelancers están ofertando un promedio de $79 por este trabajo

BestWebPlan

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.

$100 USD en 1 día
(2 comentarios)
0.8
djin

Hello. I can do it for you!

$90 USD en 3 días
(0 comentarios)
3.4
cccatalin

Hello, I can help you with this project. Please, see PMB.

$80 USD en 1 día
(0 comentarios)
0.0
viaden

Hello. We're ready to help you and provide you with the best expert complete your project in the best way. We need to discuss everything before we tell you the final price, it depends on the amount of work. Our hourly Más

$72 USD en 1 día
(0 comentarios)
4.2
nidle

Dear Sir/Madam! We've examined all Your requiements carefully. Our team of skillful and experienced C++ programmers can provide You with the service You need. Please, open PMB with us to discuss the details and we'll s Más

$20 USD en 1 día
(0 comentarios)
4.6
tanuj99

please see pmb for details

$100 USD en 6 días
(0 comentarios)
0.0