A generalization of AVL trees

DOI10.1145/355609.362340MaRDI QIDQ3212707zbMATH OpenOpenAlexFDO

Authors Caxton C. Foster

Publication date 1973

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355609.362340

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited in

(6)

• Binary search trees in secondary memory
• Height balanced 2-3 trees
• One-sided k-height-balanced trees
• On the correspondence between AVL trees and brother trees
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Graph-based genome inference from Hi-C data

This page was built for publication: A generalization of AVL trees

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