A comparative study of 2-3 trees and AVL trees

DOI10.1007/BF00996801MaRDI QIDQ3659162zbMATH OpenOpenAlexFDO

Authors Ahmed S. Zaki

Publication date 1983

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

AVL treesexpected cost comparisoninsertion algorithmquery costsstorage coststwo-three trees

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Binary Search Trees of Bounded Balance
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• Minimal-Comparison 2,3-Trees
• On random 2-3 trees
• Optimal 2,3-Trees
• Optimizing binary trees grown with a sorting algorithm
• Organization and maintenance of large ordered indexes
• Performance of height-balanced trees
• Query costs in HB(1) trees versus 2?3 trees

This page was built for publication: A comparative study of 2-3 trees and AVL trees

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