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

Can arraylist be empty?

871

What is a simple path?

985

What is the difference between hashmap and treemap?

887

Can we use ordered set for performing binary search?

909

What is best time complexity?

836

What is the difference between hashset and linkedhashset?

996

What is the minimum number of queues that can be used to implement a priority queue?

946

How do you find the time complexity of a bubble sort?

840

Why quicksort is called quick?

900

How to inverting a function in sort and searching?

977

List some applications of queue data structure.

923

Which is best book for data structures?

936

How would you implement two stacks using a single array?

980

What is the non linear data structure?

918

You want to insert a new item in a binary search tree. How would you do it?

894