A method for constructing binary search trees by making insertions at the root

DOI10.1007/BF00995807zbMath0428.68073OpenAlexW2081666277MaRDI QIDQ3865501

C. J. Stephenson

Publication date: 1980

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

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

zbMATH Keywords

binary search treessymbol tables

Mathematics Subject Classification ID

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

Related Items (1)

On top-down splaying

Cites Work

• A fast random number generator with good statistical properties
• Trees, Forests and Rearranging
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Unnamed Item

This page was built for publication: A method for constructing binary search trees by making insertions at the root