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

Which is faster arraylist or linked list?

861

You want to insert a new item in a binary search tree. How would you do it?

862

What is hash data type?

892

What is the Role of push() and pop() method?

958

What is the use of isEmpty() member methods?

932

How do I rearrange rows in numbers?

839

What are the advantages of sorting?

872

What are the categories of avl rotations?

930

Why is quicksort unstable?

866

Why hashmap is faster than hashtable?

955

What are the objectives of studying data structures?

1078

What is the difference between ienumerable and list?

811

Which sort is best for linked list?

822

Can sets contain duplicates?

778

What is difference between rb tree and avl tree?

834