Performance of height-balanced trees
From MaRDI portal
Publication:4079065
DOI10.1145/359970.359989zbMath0317.68044OpenAlexW2034403022MaRDI QIDQ4079065
Samuel H. Fuller, E. B. Kaehler, P. L. Karlton, R. E. Scroggs
Publication date: 1976
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359970.359989
Trees (05C05) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
On the average number of rebalancing operations in weight-balanced trees, Binary search trees in secondary memory, Unnamed Item, Optimal binary search trees, Unnamed Item, Embedding height balanced trees and Fibonacci trees in hypercubes, A comparative study of 2-3 trees and AVL trees, Event-Driven Simulation Scheme for Spiking Neural Networks Using Lookup Tables to Characterize Neuronal Dynamics, A NEW WEIGHT BALANCED BINARY SEARCH TREE, Query costs in HB(1) trees versus 2?3 trees
