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

DOI10.1080/00207168608803521zbMath0655.68083OpenAlexW2160146930MaRDI QIDQ3802642

T. N. V. Murthy, V. U. K. Sastry

Publication date: 1986

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

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

zbMATH Keywords

recurrence relationminimal 2-3 brother treenumber of keys

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Recurrences (11B37) Data structures (68P05)

Cites Work

• On a relationship between 2-3 brother trees and dense ternary trees
• Dense multiway trees
• 2–3 brother trees

This page was built for publication: On the number of keys in minimal 2-3 brother trees