Left and right pathlengths in random binary trees

DOI10.1007/s00453-006-0099-3zbMath1106.68085OpenAlexW2089678569MaRDI QIDQ866966

Svante Janson

Publication date: 14 February 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0099-3

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The density of the ISE and local limit laws for embedded trees ⋮ The left-right-imbalance of binary search trees ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ Left and right length of paths in binary trees or on a question of Knuth ⋮ Precise logarithmic asymptotics for the right tails of some limit random variables for random trees ⋮ The lineage process in Galton-Watson trees and globally centered discrete snakes ⋮ Limiting theorems for the nodes in binary search trees ⋮ On \(q\)-functional equations and excursion moments ⋮ Imbalance in random digital trees