Comparing insertion schemes used to update 3-2 trees

DOI10.1016/0306-4379(79)90014-0zbMath0411.68054OpenAlexW2001971599MaRDI QIDQ1259428

K. Appert

Publication date: 1979

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4379(79)90014-0

zbMATH Keywords

difference equationsrandom insertionsaverage relative frequency of subtree occurenceaverage storageinsertion coststernary-binary trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Additive difference equations (39A10)

Related Items (1)

Higher order analysis of random 1–2 brother trees

This page was built for publication: Comparing insertion schemes used to update 3-2 trees