✦ LIBER ✦

The Height of Increasing Trees

✍ Scribed by Michael Drmota

Publisher: Springer
Year: 2009
Tongue: English
Weight: 466 KB
Volume: 12
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-009-0009-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted height of random trees

✍ N. Broutin; L. Devroye; E. McLeish 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 740 KB

Forests of label-increasing trees

✍ John Riordan 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Label-increasing trees are fully labeled rooted trees with the restriction that the labels are in increasing order on every path from the root; the best known example is the binary case-no tree with more than two branches at the root, or internal vertices of degree greater than threeextensively exam

Height balance distribution of search tr

Height balance distribution of search trees

✍ Ricardo A. Baeza-Yates 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Generating binary trees of bounded heigh

Generating binary trees of bounded height

✍ C. C. Lee; D. T. Lee; C. K. Wong 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 707 KB

On the expected height of fringe-balance

On the expected height of fringe-balanced trees

✍ Luc Devroye 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

Binary search trees of almost optimal he

Binary search trees of almost optimal height

✍ Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 739 KB