Abstract: The subtrees of various sizes and patterns in random binary search trees are investigated in this paper. The expectations and variances of their numbers are first derived from an essential recursive distributional equation. Applying the contraction method, we show both of their asymptotic distributions are normal.