A comparison of iterative and defined classes of search trees

DOI10.1007/BF00999726MaRDI QIDQ3947133zbMATH OpenFDO

Authors Thomas Ottman, D. Wood

Publication date 1982

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

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

zbMATH Keywords

1-2 brother trees2-3 treesaverage case analysisAVL treesB treesiterative insertion

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• 1-2 Brother Trees or AVL Trees Revisited
• Binary Search Trees of Bounded Balance
• Dense multiway trees
• scientific article; zbMATH DE number 3750305 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3639124 (Why is no real title available?)
• On the correspondence between AVL trees and brother trees
• Organization and maintenance of large ordered indexes

Cited in

(2)

• Insertion reachability, skinny skeletons, and path length in red-black trees
• CONSTRUCTING RED-BLACK TREE SHAPES

This page was built for publication: A comparison of iterative and defined classes of search trees

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