Show that the notion of a randomly chosen binary search tree on n keys, where each binary

Question:

Show that the notion of a randomly chosen binary search tree on n keys, where each binary search tree of n keys is equally likely to be chosen, is different from the notion of a randomly built binary search tree given in this section. List the possibilities when n = 3.