A detailed examination of binary search trees reveals that the probability of making precisely i comparisons in placing the (n−1)th item in the tree is related to the (n−i)th symmetric function of the integers 1, …, n. A recurrence relation for the moments of this distribution of comparisons is derived, and formulas for the mean number of comparisons and its variance are displayed. These are shown to be in accord with previously published values.