Optimal alphabetic trees for binary search

Information Processing Letters

Volumn 67, Issue 3, 1998, Pages 137-140

  Hu, T C ^a   Tucker, P A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Alphabetic trees; Analysis of algorithms; Binary search; Two way comparison search

Indexed keywords

EID: 0041762689     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00101-x     Document Type: Article

References (4)

1. A. Andersson, A note on searching in a binary search tree, Software: Practice and Experience 21 (10) (1991) 1125-1128.
2. T.C. Hu, J.D. Morganthaler, Optimum alphabetic binary trees, Lecture Notes in Computer Sci. 1120 (1996) 234-243.
3. T.C. Hu, A.C. Tucker, Optimal computer search trees and variable-length alphabetic code, SIAM J. Appl. Math. 21 (4) (1971) 514-532.
4. D.E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, 1973.