Deletions in random binary search trees: A story of errors

The usual assumptions for the average case analysis of binary search trees (BSTs) are random insertions and random deletions. If a BST is built by n random insertions the expected number of key comparisons necessary to access a node is 2 In n + O(1). This well-known result is already contained in the first papers on such 'random' BSTs. However, if random insertions are intermixed with random deletions the analysis of the resulting BST seems to become more intricate. At least this is the impression one gets from the related publications since 1962, and it is quite appropriate to speak of a story of errors in this context, as will be seen in the present survey paper, giving an overview on this story. (C) 2010 Elsevier B.V. All rights reserved.