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

What is the difference between Array and Array List ? Explain in brief with example.

963

What is a pseudocode example?

966

What is map entry?

876

What will you prefer for traversing through a list of elements between singly and doubly linked lists?

914

What does simulation of queues mean?

1001

What is the difference between hashset and arraylist?

975

Can a class have a constructor?

929

Why is data structure?

858

What is the default capacity of hashmap?

832

Can arraylist hold duplicates?

920

What is the advantage of the heap over a stack?

999

What is impact of signed numbers on the memory using data structures?

1035

Is list an array?

832

What are examples of data structures?

925

How do you find the height of a binary tree?

886