Formula For BST is {(2n)!/(n!*n)}/(n+1) So for N=1 BST=1 N=2 BST=2 N=

How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?

Question Posted / hazrat hussain

Answer Posted / hazrat hussain

Formula For BST is
{(2n)!/(n!*n)}/(n+1)
So for
N=1 BST=1
N=2 BST=2
N=3 BST=5
N=4 BST=14
N=5 BST=42
and so on

Is This Answer Correct ?

1 Yes

0 No

Please Help Members By Posting Answers For Below Questions

How does arraylist store data?

463

Define a complete binary tree?

523

Can nsarray contain nil?

447

What is a b+ tree? Explain its uses.

516

Write the procedure to convert general tree to binary tree?

542

How to sequentially represent max-heap?

513

What is a data structure definition?

535

What do you mean by articulation point?

560

Differentiate between hashset and treeset.

530

Explain the types of linked lists.

546

Is list a data type?

485

Construct a doubly linked list using a single pointer in each node?

536

Define graph traversals?

527

Is hashmap a data structure?

524

What is a linear search?

546