aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • GATE (Computer Science & Information Technology)
  • How many distinct binary search trees can be created out ...
Multiple choice

How many distinct binary search trees can be created out of 4 distinct keys?

  1. 5

  2. 14

  3. 24

  4. 42

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The number of distinct binary search trees with n nodes is given by the nth Catalan number: C(n) = (1/(n+1)) * binom(2n, n). For n=4, C(4) = (1/5) * binom(8, 4) = (1/5) * 70 = 14.

Keep practicing — related questions

  • What is the total number of possible binary search tree with keys 20, 25 and 5?
  • We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can w...
  • Consider a B+ -tree in which the maximum number of keys in a node is 5. What is the minimum number of keys ...
  • Calculate the number of distinct trees possible for 5 unlabelled NODE.
  • The maximum number of binary trees that can be formed with three unlabeled nodes is:
  • The maximum number of binary trees that can be formed with three unlabeled nodes is:
  • How many children are there in a binary tree?
  • Let T(n) be the number of different binary search trees on n distinct elements. Then T(n) = $\sum_{k -1}^n ...
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Data Structures and Algorithms (1518 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy