Balance in AVL trees and space cost of brother trees

DOI10.1016/0304-3975(94)90040-XzbMath0824.68028OpenAlexW2021595526MaRDI QIDQ1342232

Derick Wood, Helen Cameron

Publication date: 11 January 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90040-x

zbMATH Keywords

AVL trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tight upper bound for the path length of AVL trees
• The node visit cost of brother trees
• On random 2-3 trees
• Minimal-Cost Brother Trees
• On the path length of binary trees
• 1-2 Brother Trees or AVL Trees Revisited
• A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
• A Partial Analysis of Random Height-Balanced Trees
• Expected behaviour analysis of AVL trees

This page was built for publication: Balance in AVL trees and space cost of brother trees