A binary 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 and right of the root respectively is
A. | (4,7) |
B. | (7,4) |
C. | (6,3) |
D. | (3,6) |
Option: B Explanation : Click on Discuss to view users comments. |
A. | (1 2(4 5 6 7)) |
B. | 1((2 3 NULL)4 5 6)7) |
C. | (1(234)(567) |
D. | (1(2 3 NULL)(4 5)) |
Option: C Explanation : Click on Discuss to view users comments. |
A. | Disk capacities are greater than memory capacities |
B. | Disk access is much slower than memory Access |
C. | Disk data transfer rates are much less than memory data transfer rates. |
D. | All of above |
Option: B Explanation : Click on Discuss to view users comments. |