Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 180

The DOI matches its Crossref record.

Note on the heights of random recursive trees and random m‐ary search trees

Pittel, Boris · 1994 · Random Structures & Algorithms

Abstract

A process of growing a random recursive tree Tn is studied. The sequence {Tn} is shown to be a sequence of “snapshots” of a Crump–Mode branching process. This connection and a theorem by Kingman are used to show quickly that the height of Tn is asymptotic, with probability one, to c log n. In particular, c = e = 2.718 … for the uniform recursive tree, and c = (2γ)−1, where γ e1+γ = 1, for the ordered recursive tree. An analogous reduction provides a short proof of Devroye's limit law for the height of a random m‐ary search tree. We show finally a close connection between another Devroye's result, on the height of a random union‐find tree, and our theorem on the height of the uniform recursive tree. © 1994 John Wiley & Sons, Inc.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/rsa.3240050207

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 180

Metadata

Authors
Pittel, B.
Venue
Random Structures & Algorithms
Publisher
Wiley
Published
1994-04
Volume
5
Issue
2
Pages
337-347
ISSN
  • 1042-9832 (ISSN-L)
  • 1098-2418
OpenAlex
W2152197249
Cited by
180
References
0
FWCI
4.45
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Note on the heights of random recursive trees and random m‐ary search trees. https://app.cochat.ai/papers/10.1002/rsa.3240050207
The paper
Pittel, B. (1994). Note on the heights of random recursive trees and random m‐ary search trees. Random Structures & Algorithms. https://doi.org/10.1002/rsa.3240050207

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.