Skip to main content
SpringerLink
Log in

Left and Right Pathlengths in Random Binary Trees

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We study the difference between the left and right total pathlengths in a random binary tree. The results include exact and asymptotic formulas for moments and an asymptotic distribution that can be expressed in terms of either the Brownian snake or ISE. The proofs are based on computing expectations for a subcritical binary Galton-Watson tree, and studying asymptotics as the Galton-Watson process approaches a critical one.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, Uppsala University, PO Box 480, S-751 06, Uppsala, Sweden

    Svante Janson

Authors
  1. Svante Janson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Svante Janson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janson, S. Left and Right Pathlengths in Random Binary Trees. Algorithmica 46, 419–429 (2006). https://doi.org/10.1007/s00453-006-0099-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-006-0099-3

Keywords

Search

Navigation