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

What is b tree in data structure?

901

What do you mean by open addressing?

990

Can we insert null in hashset?

1063

What is difference between list set and map?

892

What is data structures in computer science?

917

What happens if we put duplicate key in hashmap?

852

Describe tree database. Explain its common uses.

975

Difference between abstract data type, data type and data structure?

1046

Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78

1613

Why is arraylist used?

952

What is binary tree in computer science?

907

How do you determine if a binary tree is height balanced?

942

Why is hashmap faster than treemap?

904

Is pointer a variable in data structure?

1264

When would you use a tuple?

850