binary tree = n!(2^n - n). for n =3 its 30. for BST its 2n

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

Answer Posted / rohit

binary tree = n!(2^n - n).
for n =3 its 30.

for BST its 2n
C * [1/(n+1)]
n
for n=3 its 5.

Is This Answer Correct ?

1 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Write the recursive c function to count the number of nodes present in a binary tree.

919

what is the difference between singly and doubly linked lists?

1032

What is a Queue? Explain its operation with example?

1064

Differentiate between comparable and comparator.

1090

Why hashmap is faster than hashtable?

1087

Which interfaces are implemented by concurrentskiplistset?

922

Is quicksort divide and conquer?

953

What is data structure in programming language?

987

What is dequeue operation?

1022

Explain the implementation of an AVL tree and Binary tree.

1005

What is mergesort and hashtable?

1167

What is a sorting algorithm in data structure?

970

Why is data structure?

920

What is garbage collection in data structure?

1000

Explain heapsort. What is its complexity?

1034