number of binary search tree= (2n)!/{n!*(n+1)!} and number of binary tree=

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 / vipul

Answer Posted / vipul

number of binary search tree= (2n)!/{n!*(n+1)!}
and number of binary tree=(2n)!/(n+1)!

Is This Answer Correct ?

3 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Why is hashset used?

499

What do you mean by breadth first search (bfs)?

601

What is placement new in data structures?

516

What is data structure and why it is important?

467

Give a real time example of stack

538

Is array of data structure?

432

What is sort order?

478

Explain merge sort algorithms.

548

Is quicksort recursive?

527

What is the difference between array list and vector list?

493

Treemap orders the elements on which field?

506

Explain about circular linked list?

528

What do you mean by tree edge?

517

What is hashing with example?

466

What is the method to find the complexity of an algorithm?

530