The number of binary search trees that can be made with n distinct keys is given by the nth Catalan number. The formula for the nth Catalan number is:

Cn = (2n choose n) / (n + 1)

For n = 3, the number of possible binary search trees is:

C3 = (2*3 choose 3) / (3 + 1)
= (6 choose 3) / 4
= 20 / 4
= 5

So, there are 5 possible binary search trees that can be made with the keys 1, 2, 3.

Question

The number of binary search trees that can be made with n distinct keys is given by the nth Catalan number. The formula for the nth Catalan number is:

Cn = (2n choose n) / (n + 1)

For n = 3, the number of possible binary search trees is:

C3 = (2*3 choose 3) / (3 + 1)
   = (6 choose 3) / 4
   = 20 / 4
   = 5

So, there are 5 possible binary search trees that can be made with the keys 1, 2, 3.

Knowee AI · Accepted Answer

The number of binary search trees that can be made with n distinct keys is given by the nth Catalan number. The formula for the nth Catalan number is:

Cn = (2n choose n) / (n + 1)

For n = 3, the number of possible binary search trees is:

C3 = (2*3 choose 3) / (3 + 1)
   = (6 choose 3) / 4
   = 20 / 4
   = 5

So, there are 5 possible binary search trees that can be made with the keys 1, 2, 3.

How many possible binary search trees can be made with the keys 1, 2, 3?123456Submit

Question

How many possible binary search trees can be made with the keys 1, 2, 3?

Solution

Similar Questions

Upgrade your grade with Knowee