30 binary trees 10 for each 1,2 and 3. only 1 binary search tree as with 2

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

Answer Posted / anonymous

30 binary trees 10 for each 1,2 and 3.
only 1 binary search tree as with 2 as root node 1 as right child and 3 as left child.

Is This Answer Correct ?

0 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Which is better bubble sort or selection sort?

780

Data structure used to implement a menu

1062

What is the difference between arraylist and linkedlist?

921

Does linkedhashset allow null values?

931

Define secondary clustering?

862

Does hashset allow duplicates?

1016

What is the difference between Array and LinkedList?

959

What are the difference between malloc() and calloc()?

938

Define biconnectivity?

838

What's the difference between an array and vector?

837

What is binary tree in discrete mathematics?

804

Why do we use sorting?

802

Explain in brief a linked list.

909

Differentiate between set and map.

1057

What is breadth first tree?

950