Q6MCQ1 mark, −0.25Let T(n)T(n)T(n) be the number of different binary search trees on nnn distinct elements. Then T(n)=∑k=1nT(k−1)T(x)T(n) = \sum_{k=1}^{n} T(k-1)T(x)T(n)=∑k=1nT(k−1)T(x), where xxx is(A)n−k+1n-k+1n−k+1(B)n−kn-kn−k(C)n−k−1n-k-1n−k−1(D)n−k−2n-k-2n−k−2Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google