Assembling approximately optimal binary search trees efficiently using arithmetics.

Jussi Kujala Assembling approximately optimal binary search trees efficiently using arithmetics. 962-966 2009 109 Inf. Process. Lett. 16 http://dx.doi.org/10.1016/j.ipl.2008.08.012 db/journals/ipl/ipl109.html#Kujala09