On the efficiency of a new method of dictionary construction

Profiles of random trees: correlation and width of random recursive trees and binary search trees

“…BSTs were first introduced in the early 1960s by Windley (1960), Booth and Colin (1960), and Hibbard (1962), and are one of the simplest prototypical data structures; see Knuth (1997) and Mahmoud (1992). …”

Deletions in random binary search trees: A story of errors

“…The usual (and reasonable) assumption for the average case analysis of binary search trees are random insertions. In a BST built by n random insertions the expected number of key comparisons necessary to access a node is 2 ln n + O(1), which is a wellknown result already contained in the first papers on BSTs (Windley, 1960;Booth and Colin, 1960;Hibbard, 1962). However, if random insertions are intermixed with random deletions the analysis of the resulting BST seems to become much more intricate and involved.…”

“…BSTs are especially suitable for applications where (apart from accessing and dynamically inserting the symbols into the table) it is also required to linearly process them according to their sort sequence, e.g., to print a sorted list of the symbols, say. The first publications on BSTs are due to Windley (1960), Booth and Colin (1960), and Hibbard (1962). Each of these papers comprises among other things a description of binary tree insertion and the expected number of key comparisons thereby incurred.…”

Hybrid trees

“…Since the hybrid flj 'hlj tree is optimal, all subtrees must be optimal, and from (2) we have r 1 = z c I + w I [3] C1,N j--1 flj'hlj ,N…”