for binary tree ans is 5, the general formula is (2^n)-n for binary search

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

Answer Posted / shweta

for binary tree ans is 5, the general formula is (2^n)-n
for binary search tree no. of tree possible is 3.
as root data can be either 1, 2 or 3

Is This Answer Correct ?

39 Yes

38 No

Please Help Members By Posting Answers For Below Questions

What are some of the best practices relating to the java collection framework?

907

Define red-black trees.

959

Can a binary tree be empty?

931

Which interface provides the capability to store objects using a key-value pair?

1111

Can array store heterogeneous data?

836

What is best time complexity?

847

Explain implementation of traversal of a binary tree.

1058

What are arrays give example?

906

What is a pseudocode example?

975

Give a basic algorithm for searching a binary search tree?

831

What is the structure of an array?

909

Can I provide array size dynamically?

941

Which is more efficient merge sort vs quicksort?

852

Define parent node?

975

Is treeset thread safe?

913