Computer Science · Data Structures
Let T(n) be the number of different binary search trees that can be formed with n distinct elements. Then T(n) = ∑k=1n T(k - 1) T(x), where x is equal to:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1n - k + 1
- 2n - k✓
- 3n - k - 1
- 4n - k - 2
Correct answer
n - k
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures