Klein, Rolf; Wood, Derick On the path length of binary trees. (English) Zbl 0674.68012 J. Assoc. Comput. Mach. 36, No. 2, 280-289 (1989). Cited in 1 ReviewCited in 10 Documents MSC: 68P05 Data structures 68P10 Searching and sorting 68Q25 Analysis of algorithms and problem complexity Keywords:binary search; comparison; fringe thickness; node visit cost; path length; ratio of means; upper bounds PDF BibTeX XML Cite \textit{R. Klein} and \textit{D. Wood}, J. Assoc. Comput. Mach. 36, No. 2, 280--289 (1989; Zbl 0674.68012) Full Text: DOI OpenURL