On computing distances between leaves in a complete tree

DOI10.1080/00207168008803215zbMath0445.68049OpenAlexW1996025191MaRDI QIDQ3890125

Arnold L. Rosenberg, Raymond E. Miller

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1080/00207168008803215

zbMATH Keywords

algorithmsdistances between leaves in a complete tree

Mathematics Subject Classification ID

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

Related Items

Searching and encoding for infinite ordered sets

Cites Work

• Unnamed Item
• Data encodings and their costs
• An almost optimal algorithm for unbounded searching
• Encoding Data Structures in Trees
• On Finding Lowest Common Ancestors in Trees
• Pyramids: A data type for matrix representation in Pascal
• Preserving average proximity in arrays