There are 5 different binary search trees that can store the keys (A, B, C, D). The possible trees are: A(B(C(D))), A(C(B(D))), B(A(C(D))), B(C(A(D))), C(A(B(D))).Read less