On Some Parameters in Heap Ordered Trees

DOI10.1017/S0963548304006194zbMATH Open1098.68098OpenAlexW2039852779MaRDI QIDQ4670360FDOQ4670360

Authors: Kate Morris, Alois Panholzer, Helmut Prodinger 

Publication date: 18 April 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548304006194

Recommendations

• Descendants in heap ordered trees or a triumph of computer algebra
• DEPTH AND PATH LENGTH OF HEAP ORDERED TREES
• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• The height of increasing trees
• scientific article; zbMATH DE number 2159651

zbMATH Keywords

planted plane trees

Mathematics Subject Classification ID

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

Cited In (7)

• Pairing heaps, scrambled pairing and square-root trees
• On sorting, heaps, and minimum spanning trees
• Analysis of some parameters for random nodes in priority trees
• Tree evolution processes for bucket increasing trees
• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• Tree limits and limits of random trees
• Limit theorems for depths and distances in weighted random \(b\)-ary recursive trees

This page was built for publication: On Some Parameters in Heap Ordered Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670360)