DEPTH AND PATH LENGTH OF HEAP ORDERED TREES

DOI10.1142/S0129054196000208zbMath0859.68069OpenAlexW2058114850MaRDI QIDQ5687661

Prodinger, Helmut

Publication date: 16 December 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054196000208

zbMATH Keywords

Catalan numbersincreasing trees

Mathematics Subject Classification ID

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

Related Items (3)

On bucket increasing trees, clustered increasing trees and increasing diamonds ⋮ Depth of nodes in random recursive \(k\)-ary trees ⋮ Width and mode of the profile for some random trees of logarithmic height

This page was built for publication: DEPTH AND PATH LENGTH OF HEAP ORDERED TREES