Query costs in HB(1) trees versus 2?3 trees

DOI10.1007/BF00996136zbMath0482.68059MaRDI QIDQ3940859

Jean-Loup Baer, Ahmed S. Zaki

Publication date: 1981

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

zbMATH Keywords

binary search treesAVL treestree heightkey comparisondense and sparse nodesnode visit

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

A comparative study of 2-3 trees and AVL trees

Cites Work

• Performance of height-balanced trees
• Minimal-Comparison $2,3$-Trees
• Optimizing binary trees grown with a sorting algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Query costs in HB(1) trees versus 2?3 trees