CORR
2006
Springer
13 years 11 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
ESA
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...