binary search tree=(2^n)-n i.e (2^3)-3=5 binary tree=((2^n)-n)*n! i.e ((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 / shalini

Answer Posted / shalini

binary search tree=(2^n)-n i.e (2^3)-3=5
binary tree=((2^n)-n)*n! i.e ((2^3)-3)*3!=30

this is the right answer!!!!

Is This Answer Correct ?

2 Yes

4 No

Please Help Members By Posting Answers For Below Questions

What is data structure and its operations?

788

What are the disadvantages of sequential storage?

1180

Is a hashset ordered?

927

Can you make an arraylist of arrays?

1025

What does sorting an array do?

887

Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.

829

Are dictionaries mutable?

814

Explain Stack

939

What are the disadvantages of circular list?

910

How many types of linked list exist?

909

How does dynamic memory allocation help in managing data?

1456

What is a class user?

905

List the types of tree.

857

What is binary tree used for?

895

What is sorting an array?

861