optimal binary search tree(obst)

[navdeep89]

hi,
I am trying the obst in cpp and m held up in deciding how to calculate the min values for each key (i.e the corres. root table value) and what data structure to use.


pls someone help me !!!!!!!

[jkmyoung]

hi,
I am trying the obst in cpp and m held up in deciding how to calculate the min values for each key (i.e the corres. root table value) and what data structure to use.


pls someone help me !!!!!!!

How are you going to be using it: Is the binary tree set up once, or do you continue adding elements? Deleting elements?

Just to double check, where are you getting the frequencies for these elements, and do they add up to 1, or some other arbitrary number?