Randomized binary searching with tree structures

Harry A. Clampett

Communications of the ACM · 1964 · 34 citations · 7 references

DOIFull text

Open access

Concepts

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.

References

7