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

Is array static or dynamic?

869

Define probing?

1148

Is arraylist better than array?

939

What is raid (redundant array of inexpensive disks)?

982

What is a b+ tree? Explain its uses.

948

What are the disadvantages of circular list?

971

Explain Array

961

What are linear and non linear data structures?

857

What do you mean by data and data structure?

963

List the two important key points of depth first search?

1212

What are the tasks performed during inorder traversal?

966

How do we find duplicate elements in an array?

962

What are the different types of data structures?

1008

How to do the intersection of two sorted arrays?

1028

What are different techniques for making hash function?

903