If the element is a root node ,in a 1st search it will find the element.

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

Answer Posted / kalai

If the element is a root node ,in a 1st search it will find
the element. If the element is either a lchild or rchild it
make 2 searches.

Is This Answer Correct ?

2 Yes

7 No

Please Help Members By Posting Answers For Below Questions

How can you represent a linked list node?

990

What is an ordered list?

1039

Does arraylist maintain insertion order?

886

Define heap?

1158

What is an acyclic graph?

1085

Which language is best for learning data structures and algorithms?

1019

State the properties of b tree.

1104

Define the term “percolate down”?

1056

What is array in data structure with example?

1007

How can you insert a node to the beginning of a singly linked list?

996

What does it mean to sort an array?

1067

How many types of searching are there in data structure?

889

What is return map?

1016

How to fill element (initialize at once) in an array?

1089

Can a tree be empty?

935