On the relationship between son-trees and symmetric binary B-trees

DOI10.1016/0020-0190(80)90112-XzbMath0422.68029OpenAlexW2016297145MaRDI QIDQ1133900

H. Olivie

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90112-x

zbMATH Keywords

data structuresbinary search treesbalanced treesorganization of a dictionary

Mathematics Subject Classification ID

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

Related Items

Maintaining α-balanced trees by partial rebuilding, Binary search trees of almost optimal height, On random son-trees, Updating a balanced search tree in 0(1) rotations

Cites Work

• Axioms and hulls
• On the correspondence between AVL trees and brother trees
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item