for binary tree answer is n! ways that is 3!=6 For Binary search tree n

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

Answer Posted / kanha

for binary tree answer is n! ways that is 3!=6

For Binary search tree n ways..that is 3

Is This Answer Correct ?

17 Yes

52 No

Please Help Members By Posting Answers For Below Questions

How to sort 1 million floating point numbers?

1185

What is a hash index?

881

What are three common types of traversals?

1009

Explain Array

966

What is shell sort in data structure?

858

What is immutablelist?

917

What do you mean by spanning tree?

1115

How to cut or remove an element from the array?

965

Which is faster quick sort or merge sort?

823

In what areas do data structures are applied?

954

What are the disadvantages of linear list?

911

What is ascii sort order?

908

What is queue in data structure?

969

Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

919

Does hashmap allow duplicate keys?

1008