Randomized Binary Searching With Tree Structure A more efficient method of using tree structures is proposed, which utilizers both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters. CACM March, 1964 Clampett Jr., H. A. CA640317 JB March 10, 1978 2:30 AM 1115 5 1115 1115 5 1115 1115 5 1115 1935 5 1115 849 6 1115 1115 6 1115