A. | logn nodes |
B. | n + 1 nodes |
C. | 2n-1 nodes |
D. | 2n + 1 nodes |
Option: D Explanation : Click on Discuss to view users comments. |
If this tree is used for sorting, then new no 8 should be placed as the
A. | left child of the node labelled 30 |
B. | right child of the node labelled 5 |
C. | right child of the node labelled 30 |
D. | left child of the node labelled 10 |
Option: D Explanation : Click on Discuss to view users comments. |
A. | 10 |
B. | 09 |
C. | 12 |
D. | 13 |
Option: D Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Data Structures Questions Answers using C language .
Who can benefit -
Various Search Terms used for this section are