Optimal alphabetic trees for binary search

Optimal alphabetic trees for binary search

Search in a conventional binary search tree requires three-way key comparison (). High-level language support for three-way branch on comparison is rare, and experiments have shown that a modified tree requiring only two-way key comparison (

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1998-08, Vol.67 (3), p.137-140
Hauptverfasser: Hu, T.C., Tucker, P.A.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Alphabetic trees
Analysis of algorithms
Applied sciences
Binary search
Binary system
Computer science
control theory
systems
Exact sciences and technology
Information processing
Information retrieval. Graph
Searches
Studies
Theoretical computing
Two-way comparison search
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Search in a conventional binary search tree requires three-way key comparison (). High-level language support for three-way branch on comparison is rare, and experiments have shown that a modified tree requiring only two-way key comparison (
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(98)00101-X