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

What is bubble sort and quick sort?

896

What is an expression tree?

902

How many links are there in a binary tree of N nodes?

966

There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?

1663

What is the use of tree data structure?

824

List the applications of stacks?

1025

What is binary tree and its types?

906

Explain binary representation?

818

Where is insertion sort used?

857

Which process places data at the back of the queue?

1092

What are different dynamic memory allocation technique in c.

887

What is circular linked list?

899

Differentiate between the singly linked list and doubly linked list.

940

Difference between hashset and treeset?

986

Can tuple be sorted?

869