On the combinatorics of leftist trees

DOI10.1016/S0166-218X(00)00250-XzbMath0980.05021OpenAlexW2078805715MaRDI QIDQ5931792

P. Nogueira

Publication date: 4 March 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00250-x

zbMATH Keywords

generating functionanalytic propertiesleftist trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On the representation of simply generated trees by leftist trees

Cites Work

• A note on the number of leftist trees
• The average height of binary trees and other simple trees
• The expected additive weight of trees
• The number of trees
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
• Asymptotic Methods in Enumeration
• On the Altitude of Nodes in Random Trees
• The asymptotic number of leftist trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the combinatorics of leftist trees