On a relationship between 2-3 brother trees and dense ternary trees

DOI10.1080/00207168008803209zbMath0449.05019OpenAlexW2050838474MaRDI QIDQ3895493

H. Olivie

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/00207168008803209

zbMATH Keywords

search treenumber of leaves2-3 brother treesdense ternary trees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (1)

On the number of keys in minimal 2-3 brother trees

Cites Work

• 2–3 brother trees
• Unnamed Item

This page was built for publication: On a relationship between 2-3 brother trees and dense ternary trees