Binary search trees in secondary memory

DOI10.1007/BF00269807zbMath0446.68048OpenAlexW2043823800MaRDI QIDQ1146005

William E. Wright

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

binary search treesAVL treessecondary memoryAVL algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

Optimal binary search trees

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly optimal binary search trees
• Organization and maintenance of large ordered indexes
• Optimum binary search trees
• A generalization of AVL trees
• Performance of height-balanced trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Binary Search Trees of Bounded Balance
• Upper Bounds for the Total Path Length of Binary Trees