A binary search tree is generated by inserting in order of the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24. The number of nodes in the left subtree and right subtree of the root respectively isa)(4, 7)b)(7,4)c)(8,3)d)(3,8)Correct answer is option 'B'. Can you explain this answer?

Question

Answer

Explanation:
To determine the number of nodes in the left subtree and right subtree of the root, we need to construct the binary search tree using the given integers.

Step 1: Insert the first integer, 50, as the root of the tree.

```
50
```

Step 2: Insert the second integer, 15. Since 15 is less than 50, it becomes the left child of 50.

```
50
/
15
```

Step 3: Insert the third integer, 62. Since 62 is greater than 50, it becomes the right child of 50.

```
50
/ \
15 62
```

Step 4: Insert the fourth integer, 5. Since 5 is less than 50 and less than 15, it becomes the left child of 15.

```
50
/ \
15 62
/
5
```

Step 5: Insert the fifth integer, 20. Since 20 is greater than 15 and less than 50, it becomes the right child of 15.

```
50
/ \
15 62
/ \
5 20
```

Step 6: Insert the sixth integer, 58. Since 58 is less than 62 and greater than 50, it becomes the left child of 62.

```
50
/ \
15 62
/ \ /
5 20 58
```

Step 7: Insert the seventh integer, 91. Since 91 is greater than 62, it becomes the right child of 62.

```
50
/ \
15 62
/ \ / \
5 20 58 91
```

Step 8: Insert the eighth integer, 3. Since 3 is less than 50, 15, and 5, it becomes the left child of 5.

```
50
/ \
15 62
/ \ / \
5 20 58 91
/
3
```

Step 9: Insert the ninth integer, 8. Since 8 is greater than 5 and less than 15, it becomes the right child of 5.

```
50
/ \
15 62
/ \ / \
5 20 58 91
/ \
3 8
```

Step 10: Insert the tenth integer, 37. Since 37 is greater than 20 and less than 50, it becomes the right child of 20.

```
50
/ \
15 62
/ \ / \
5 20 58 91
/ \
8 37
```

Step 11: Insert the eleventh integer, 60. Since 60 is greater than 58 and less than 62, it becomes the right child of 58.

Similar Computer Science Engineering (CSE) Doubts

A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91,3, 8, 37,60, 24. The number of nodes in the left subtree and right subtree of the root respectively is

A binary search tree is generated by inserting in order the following integers:50, 15, 62, 5, 20,58, 91, 3, 8, 37, 60, 24The number of nodes in the left subtree and right subtree of the root respectively is

A binary search tree is generated by inserting the following integers in order:50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24How many nodes are there in the left sub-tree and the right sub-tree of the root, respectively?

Direction: A binary search tree is constructed by inserting the following numbers in order.60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34The number of nodes in the left subtree is: Correct answer is '7'. Can you explain this answer?

A B+ -tree of order 3 is generated by inserting 89, 9 and 8. The generated B+ -tree is __________

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

Top Courses for Computer Science Engineering (CSE)

Suggested Free Tests

Related Content

Mock Test Series

Subject-wise Courses

Subject-wise Courses

Other Engg Branches

Company