CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Quantitative Aptitude

Three Sets Venn Diagram

The following...

Question

The following numbers are inserted into an empty binary search tree in the given order:

10, 1, 3, 5, 15, 12, 16

What is the height of the binary search tree (the height is the maximum distance of a leaf node form the root)?

A

3

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

6

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

4

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A 3
The binary search tree is initially empty.

So the maximum height of BST = 3 [Distance from element 5 to root 10 is 3]

Suggest Corrections

thumbs-up

1

Similar questions

Q. Assume that the following values are inserted into binary search tree in the given order : 40, 50, 70, 20, 30, 10, 60, 90, 80, 100. Consider the following function:

Find the output printed by the above function, if the root of the binary search tree is passed to the "tree" function.

Void find (Node*root)
{
if (root == NULL) return;
find (root

\to

left)
find (root

\to

right);
printf("%d" , root

\to

data);
}
struct node
{
int data;
struct node * left;
struct node * right;
} Node;

Q. Consider we constructed binary search tree shown below starting with an empty tree and elements 2, 7, 12, 14, 15, 20, 25, 28, 30 and 40 are come in any order:

Which of the following about the order of elements in input sequence can be true?

Q. The maximum number of nodes on level

5

of a binary tree.

Q. Consider a binary tree, where for every node P -

Q \leq 2

, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such a binary tree of height h = 4 will be

Q. A weight balanced tree is a binary tree in which for each node, the number of nodes in left subtree is at least half at most twice the number of nodes in the right subtree. The maximum possible height of such a tree on n nodes is best described by which of the following?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Three Sets Venn Diagram

QUANTITATIVE APTITUDE

Watch in App

explore_more_icon

Explore more

Three Sets Venn Diagram

Other Quantitative Aptitude

Join BYJU'S Learning Program

CrossIcon