Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Upper Bounds on the Average Height of Random Binary Trees (2405.17952v1)

Published 28 May 2024 in math.CO and cs.DM

Abstract: We study the average height of random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binary tree source induces for every $n \geq 2$ a probability distribution on the set of binary trees with $n$ leaves. Our results generalize a result by Devroye, according to which the average height of a random binary search tree of size $n$ is in $\mathcal{O}(\log n)$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. The height of increasing trees. Random Struct. Algorithms, 32(4):494–518, 2008.
  2. The distribution of height and diameter in random non-plane binary trees. Random Struct. Algorithms, 41(2):215–252, 2012.
  3. The average height of planted plane trees. In Graph theory and computing, pages 15–22. Elsevier, 1972.
  4. Luc Devroye. A probabilistic analysis of the height of tries and of the complexity of triesort. Acta Informatica, 21:229–237, 1984.
  5. Luc Devroye. A note on the height of binary search trees. J. ACM, 33(3):489–498, 1986.
  6. Luc Devroye. Branching processes in the analysis of the heights of trees. Acta Informatica, 24(3):277–298, 1987.
  7. Luc Devroye. On the height of random m-ary search trees. Random Structures & Algorithms, 1(2):191–203, 1990.
  8. On the variance of the height of random binary search trees. SIAM Journal on Computing, 24(6):1157–1162, 1995.
  9. Michael Drmota. An analytic approach to the height of binary search trees. Algorithmica, 29(1):89–119, 2001.
  10. Michael Drmota. The variance of the height of binary search trees. Theoretical Computer Science, 270(1-2):913–919, 2002.
  11. Michael Drmota. An analytic approach to the height of binary search trees II. J. ACM, 50(3):333–374, 2003.
  12. Michael Drmota. On robson’s convergence and boundedness conjectures concerning the height of binary search trees. Theor. Comput. Sci., 329(1-3):47–70, 2004.
  13. Michael Drmota. Random Trees: An Interplay Between Combinatorics and Probability. Springer Publishing Company, Incorporated, 1st edition, 2009.
  14. Philippe Flajolet. On the performance evaluation of extendible hashing and trie searching. Acta Informatica, 20:345–369, 1983.
  15. The average height of binary trees and other simple trees. J. Comput. Syst. Sci., 25(2):171–213, 1982.
  16. Universal tree source coding using grammar-based compression. IEEE Trans. Inf. Theory, 65(10):6399–6413, 2019.
  17. Structural complexity of random binary trees. In Proceedings of the 2009 IEEE International Symposium on Information Theory, ISIT 2009, pages 635–639. IEEE, 2009.
  18. Asymptotic behavior of the height in a digital search tree and the longest phrase of the lempel-ziv scheme. SIAM J. Comput., 30(3):923–964, 2000.
  19. The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci., 289(1):649–703, 2002.
  20. Markus Lohrey Louisa Seelbach Benkner and Stephan Wagner. Average case analysis of leaf-centric binary tree sources. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, pages 16:1–16:15, 2018.
  21. Markus Lohrey Louisa Seelbach Benkner and Stephan Wagner. Average case analysis of leaf-centric binary tree sources. CoRR, abs/1804.10396, 2022.
  22. Hypersuccinct trees - new universal tree source codes for optimal compressed tree data structures and range minima. In Petra Mutzel, Rasmus Pagh, and Grzegorz Herman, editors, 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), volume 204 of LIPIcs, pages 70:1–70:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  23. Boris Pittel. On growing random binary trees. Journal of Mathematical Analysis and Applications, 103(2):461–480, 1984.
  24. On the height of trees. Journal of the Australian Mathematical Society, 7(4):497–507, 1967.
  25. John Michael Robson. The height of binary search trees. Australian Computer Journal, 11(4):151–153, 1979.
  26. John Michael Robson. The asymptotic behaviour of the height of binary search trees. Australian Computer Science Communications, 4(1):88–98, 1982.
  27. Wojciech Szpankowski. On the height of digital trees and related problems. Algorithmica, 6(2):256–277, 1991.
  28. A universal grammar-based code for lossless compression of binary trees. IEEE Transactions on Information Theory, 60(3):1373–1386, 2014.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now