Abstract
We study the effect of a well-known balancing heuristic on the expected height of a random binary search tree. After insertion of an element, if any node on the insertion path has a subtree of size precisely 2t+1 for a fixed integert, then the subtree rooted at that node is destroyed and replaced by a new subtree in which the median of the 2t+1 elements is the new root. IfH n denotes the height of the resulting random tree, we show thatH n /logn →c(t) in probability for some functionc(t). In particular,c(0)=4.31107... (the ordinary binary search tree),c(1)=3.192570 ...,c(3)=2.555539 ...,c(10)=2.049289 ... andc(100)=1.623695 ....
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldous, D., Flannery, B., Palacios, J.L.: Two applications of urn processes: the fringe analysis of search trees and the simulation of quasi-stationary distributions of Markov chains. Probab. Eng. Inf. Sci.2, 293–307 (1988)
Bell, C.J.: An investigation into the principles of the classification and analysis of data of an automatic digital computer. Doctoral Dissertation, Leeds University, 1965
Biggins, J.D.: The first and last-birth problems for a multitype age-dependent branching process. Adv. Appl. Probab.8, 446–459 (1976)
Biggins, J.D.: Chernoff's theorem in the branching random walk. J. Appl. Probab.14, 630–636 (1977)
Devroye, L.: A note on the height of binary search trees. J. ACM33, 489–498 (1986)
Devroye, L.: Branching processes in the analysis of the heights of trees. Acta Inf.24, 277–298 (1987)
Devroye, L.: On the height of randomm-ary search trees. Random Struct. Algorithms1, 191–203 (1990)
Gonnet, G.H., Baeza-Yates, R.: Handbook of algorithms and data structures. Reading: Addison-Wesley 1991
Hammersley, J.M.: Postulates for subadditive processes. Ann. Probab.2, 652–680 (1974)
Kingman, J.F.C.: Subadditive ergodic theory. Ann. Probab.1, 883–909 (1973)
Mahmoud, H.M.: Evolution of Random Search Trees. New York: John Wiley 1992
Pittel, B.: On growing random binary trees. J. Math. Anal. Appl.103, 461–480 (1984)
Pittel, B.: Note on the heights of random recursive trees and randomm-ary search trees. Technical Report, Department of Mathematics, The Ohio State University 1992
Poblete, P.V., Munro, J.I.: The analysis of a fringe heuristic for binary search trees. J. Algorithms6, 336–350 (1985)
Pyke, R.: Spacings. J. R. Stat. Soc. Ser. B7, 395–445 (1965)
Robson, J.M.: The height of binary search trees. Aust. Comput. J.11, 151–153 (1979)
Walker, A., Wood, D.: Locally balanced binary trees. Comput. J.19, 322–325 (1976)
Author information
Authors and Affiliations
Additional information
Research of the author was sponsored by NSERC Grant A3456 and by FCAR Grant 90-ER-0291
Rights and permissions
About this article
Cite this article
Devroye, L. On the expected height of fringe-balanced trees. Acta Informatica 30, 459–466 (1993). https://doi.org/10.1007/BF01210596
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01210596