2–3 brother trees

DOI10.1007/BF01932021zbMath0405.68054MaRDI QIDQ4191614

Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood

Publication date: 1978

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

Computational ComplexityBinary TreesBrother TreesInsertion AlgorithmDelection AlgorithmsSearch Trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Related Items (4)

On the number of keys in minimal 2-3 brother trees ⋮ Higher order analysis of random 1–2 brother trees ⋮ On a relationship between 2-3 brother trees and dense ternary trees ⋮ Time- and Space-optimal height-balanced 2-3 brother trees

Cites Work

• On random 2-3 trees
• Unnamed Item
• Unnamed Item

This page was built for publication: 2–3 brother trees