GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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

A

4

B

14

C

24

D

42

asked in trees, binary search trees, binary heaps by gate

1 Answer

0 votes

B

14

No. of BST= 2nCn/(n+1) 

therefore 8C4/5 =14 option b

answered by gate

Related questions

The best answer to any question