A principle of independence for binary tree searching

SummaryWhen searching unsuccessfully for a fixed element in a random binary search tree, the number of comparisons made whose result is “less” is independent from the number of comparisons whose result is “greater”. This principle can be used to compute the mean and variance of the total number of comparisons involved in both a successful and an unsuccessful search.