How many structurally different binary search trees can be built with 4 distinct keys?

Explanation

The number of BSTs with n keys is the Catalan number C(2n, n)/(n + 1); for n = 4 it is 70/5 = 14.