binary search tree = 5 1 1 2 3 3 \ \ / \

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

Answer Posted / mousumi

binary search tree = 5

1 1 2 3 3
\ \ / \ / /
2 3 1 3 1 2
\ / \ /
3 2 2 1

binary tees = (2^3)-3=5

Is This Answer Correct ?

4 Yes

6 No

Please Help Members By Posting Answers For Below Questions

Define an equivalence relation?

1142

What member function places a new node at the end of the linked list?

1126

What is a list in data structure?

1006

What is the time complexity of hashmap get () and put () method?

942

What are the two types of data?

1066

If you do not initialize an array what will happen?

1080

What is basic data structure?

953

What is stable sort?

1067

Explain exception filter?

1017

What are the disadvantages of linked list?

942

What is the logic to reverse the array?

955

Can arraylist be empty?

926

What is difference between array and string?

1063

Why arraylist is not efficient for manipulation?

910

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

1071