Right brother trees

DOI10.1145/359588.359607MaRDI QIDQ4184345zbMATH OpenOpenAlexFDO

Authors Thomas Ottmann, Hans-Werner Six, D. Wood

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

Deletion AlgorithmInsertion AlgorithmOne-Sided Height-Balanced TreesRight Brother Trees

Mathematics Subject Classification ID

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

Cited in

(6)

• 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
• On the correspondence between AVL trees and brother trees
• Deletion in one-sided height balanced search trees

This page was built for publication: Right brother trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184345)