Internal path length of the binary representation of heap-ordered trees

DOI10.1016/0020-0190(94)00081-6zbMath0942.68645OpenAlexW2050605871MaRDI QIDQ1332753

Wen-Chin Chen, Wen-Chun Ni

Publication date: 14 August 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154493/1/06.pdf

Mathematics Subject Classification ID

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

Related Items (4)

ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ Condensation phenomena in preferential attachment trees with neighbourhood influence ⋮ Degree distributions in recursive trees with fitnesses ⋮ Dynamical models for random simplicial complexes

Cites Work

• Distances in random plane-oriented recursive trees
• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• Unnamed Item

This page was built for publication: Internal path length of the binary representation of heap-ordered trees