The node visit cost of brother trees

DOI10.1016/0890-5401(87)90053-8zbMath0636.68077OpenAlexW1556080432MaRDI QIDQ1098304

Derick Wood, Rolf Klein

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90053-8

zbMATH Keywords

node visit costbrother search tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

Balance in AVL trees and space cost of brother trees ⋮ A tight upper bound for the path length of AVL trees

Cites Work

• Unnamed Item
• Unnamed Item
• Axioms and hulls
• On the correspondence between AVL trees and brother trees
• Minimal-Cost Brother Trees
• 1-2 Brother Trees or AVL Trees Revisited
• Right brother trees
• Binary Search Trees of Bounded Balance