×

zbMATH — the first resource for mathematics

Further results on leftist trees. (English) Zbl 0742.05030
Random graphs ’87, Proc. 3rd Int. Semin., Poznań/Poland 1987, 103-130 (1990).
Summary: [For the entire collection see Zbl 0726.00010.]
We deal with the class of leftist trees with \(n\) leaves. Assuming that all these trees are equally likely to occur, asymptotic equivalents to some familiar parameters will be derived. These parameters are special cases of an arbitrary weight introduced in this paper. The presented results also imply that leftist trees are not simply generated.

MSC:
05C05 Trees
68R10 Graph theory (including graph drawing) in computer science
Keywords:
leftist trees
PDF BibTeX XML Cite