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) (4, 7)
(B) (7, 4)
(C) (8, 3)
(D) (3, 8)
Answer: (B)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
Recommended Posts:
- GATE | GATE CS 1996 | Question 41
- GATE | GATE CS 1996 | Question 42
- GATE | GATE CS 1996 | Question 43
- GATE | GATE CS 1996 | Question 44
- GATE | GATE CS 1996 | Question 45
- GATE | GATE CS 1996 | Question 1
- GATE | GATE CS 1996 | Question 2
- GATE | GATE CS 1996 | Question 3
- GATE | GATE CS 1996 | Question 4
- GATE | GATE CS 1996 | Question 5
- GATE | GATE CS 1996 | Question 6
- GATE | GATE CS 1996 | Question 7
- GATE | GATE CS 1996 | Question 8
- GATE | GATE CS 1996 | Question 9
- GATE | GATE CS 1996 | Question 10
- GATE | GATE CS 1996 | Question 11
- GATE | GATE CS 1996 | Question 12
- GATE | GATE CS 1996 | Question 13
- GATE | GATE CS 1996 | Question 14
- GATE | GATE CS 1996 | Question 15
