On the correspondence between AVL trees and brother trees

DOI10.1007/BF02252612zbMath0399.68069OpenAlexW1576929993MaRDI QIDQ1254854

Derick Wood, Hans-Werner Six, Thomas Ottmann

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02252612

zbMATH Keywords

Brother TreesHeight-Balanced Search TreesInsertion AlgorithmsNonstandard Updating Algorithms

Mathematics Subject Classification ID

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

Related Items (11)

Parallel dictionaries with local rules on AVL and brother trees ⋮ The node visit cost of brother trees ⋮ On the relationship between son-trees and symmetric binary B-trees ⋮ A tight upper bound for the path length of AVL trees ⋮ (g//0,g//1,\dots ,g//k)-trees and unary OL systems ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ Height balanced 2-3 trees ⋮ On the correspondence between AVL trees and brother trees ⋮ Purely Functional 1-2 Brother Trees ⋮ Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees ⋮ A comparison of iterative and defined classes of search trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-sided k-height-balanced trees
• On the correspondence between AVL trees and brother trees
• A generalization of AVL trees
• Dense multiway trees
• On the Height of Height-Balanced Trees
• Right brother trees

This page was built for publication: On the correspondence between AVL trees and brother trees