1-2 Brother Trees or AVL Trees Revisited

DOI10.1093/comjnl/23.3.248zbMath0435.68052OpenAlexW2101526436MaRDI QIDQ3875357

Thomas Ottmann, Derick Wood

Publication date: 1980

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/428bf2a34404ae527edc2f0d2b35f2f2221d2270

zbMATH Keywords

binary search treesbrother trees

Mathematics Subject Classification ID

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

Related Items (13)

Parallel dictionaries with local rules on AVL and brother trees ⋮ Balance in AVL trees and space cost of brother trees ⋮ Expected behaviour analysis of AVL trees ⋮ The node visit cost of brother trees ⋮ Optimum multiway search trees ⋮ Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees ⋮ A tight upper bound for the path length of AVL trees ⋮ Improved bounds for the expected behaviour of AVL trees ⋮ Higher order analysis of random 1–2 brother trees ⋮ Automatic Functional Correctness Proofs for Functional Search Trees ⋮ On random son-trees ⋮ Purely top-down updating algorithms for stratified search trees ⋮ A comparison of iterative and defined classes of search trees

This page was built for publication: 1-2 Brother Trees or AVL Trees Revisited