Right brother trees

DOI10.1145/359588.359607zbMath0399.68068OpenAlexW2049539667MaRDI QIDQ4184345

Thomas Ottmann, Derick Wood, Hans-Werner Six

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359588.359607

zbMATH Keywords

One-Sided Height-Balanced TreesDeletion AlgorithmInsertion AlgorithmRight Brother Trees

Mathematics Subject Classification ID

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

Related Items

The node visit cost of brother trees ⋮ (g//0,g//1,\dots ,g//k)-trees and unary OL systems ⋮ Height balanced 2-3 trees ⋮ One-sided k-height-balanced trees ⋮ Deletion in one-sided height balanced search trees ⋮ On the correspondence between AVL trees and brother trees