A comparison of iterative and defined classes of search trees

DOI10.1007/BF00999726zbMath0486.68058MaRDI QIDQ3947133

Thomas Ottman, Derick Wood

Publication date: 1982

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

zbMATH Keywords

average case analysisAVL trees2-3 trees1-2 brother treesB treesiterative insertion

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the correspondence between AVL trees and brother trees
• Organization and maintenance of large ordered indexes
• 1-2 Brother Trees or AVL Trees Revisited
• Dense multiway trees
• Binary Search Trees of Bounded Balance

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