Performance of height-balanced trees

DOI10.1145/359970.359989MaRDI QIDQ4079065zbMATH OpenOpenAlexFDO

Authors P. L. Karlton, Samuel H. Fuller, R. E. Scroggs, E. B. Kaehler

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

Mathematics Subject Classification ID

Trees (05C05) General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Cited in

(10)

• Embedding height balanced trees and Fibonacci trees in hypercubes
• On the average number of rebalancing operations in weight-balanced trees
• Binary search trees in secondary memory
• Event-Driven Simulation Scheme for Spiking Neural Networks Using Lookup Tables to Characterize Neuronal Dynamics
• A comparative study of 2-3 trees and AVL trees
• scientific article; zbMATH DE number 3928331 (Why is no real title available?)
• Query costs in HB(1) trees versus 2?3 trees
• scientific article; zbMATH DE number 3770965 (Why is no real title available?)
• A new weight balanced binary search tree
• Optimal binary search trees

This page was built for publication: Performance of height-balanced trees

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