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

Explain the uses of binary tree.

922

What is the minimum number of queues needed when implementing a priority queue?

1013

Define disjoint set adt?

941

What is time complexity of sorting algorithms?

937

What is the difference between the hash table and hash map?

1014

What do you mean by Syntax Error

1077

Can we use ordered set for performing binary search?

923

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

1108

How does arraylist size work?

900

What is the use of hashtable?

892

What is a data structure definition?

962

Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?

1024

What data structure does a binary tree degenerate?

902

What is a pseudocode example?

978

What is collision in data structure?

943