Name
Abstract | ||
|---|---|---|
A more efficient method of using tree structures is proposed, which utilizes both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters. |
Year | DOI | Venue |
|---|---|---|
1964 | 10.1145/363958.363987 | Commun. ACM |
Keywords | Field | DocType |
randomized binary,search key,tree structure,minus branch,search path,efficient method,significant gains result,alphabetic character,binary search | AVL tree,Computer science,Self-balancing binary search tree,K-ary tree,Binary tree,Optimal binary search tree,Theoretical computer science,Ternary search tree,Cartesian tree,Interval tree | Journal |
Volume | Issue | ISSN |
7 | 3 | 0001-0782 |
Citations | PageRank | References |
24 | 22.96 | 0 |
Authors | ||
2 | ||