2003•Lecture notes in computer scienceRequires access
New Ways to Construct Binary Search Trees
Travis Gagie
Open publisher page 10 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Travis Gagie
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Construct (python library), Ternary search tree, Binary number, Computer science, Binary tree, Mathematics, Algorithm, Programming language