Binary search trees in secondary memory

DOI10.1007/BF00269807zbMATH Open0446.68048OpenAlexW2043823800MaRDI QIDQ1146005FDOQ1146005

Authors: 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

AVL treesbinary search treessecondary memoryAVL algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Binary Search Trees of Bounded Balance
• Organization and maintenance of large ordered indexes
• Optimum binary search trees
• Nearly optimal binary search trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Upper Bounds for the Total Path Length of Binary Trees
• Performance of height-balanced trees
• A generalization of AVL trees
• Title not available (Why is that?)

Cited In (1)

• Optimal binary search trees

This page was built for publication: Binary search trees in secondary memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146005)