Programming and Data Structures - Trees
7. If this tree is used for sorting, then new no 8 should be placed as the
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
9. A complete binary tree of level 5 has how many nodes ?
- Option : C
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
10. Traversing a binary tree first root and then left and right subtrees called _______traversal.
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.