info@avatto.com
+91-9920808017
6. A full binary tree with n non-leaf nodes contains
logn nodes
n + 1 nodes
2n-1 nodes
2n + 1 nodes
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
7. If this tree is used for sorting, then new no 8 should be placed as the
left child of the node labeled 30
right child of the node labeled 5
right child of the node labeled 30
left child of the node labeled 10
8. A 3-ary tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 6 internal nodes will be
10
09
12
13
9. A complete binary tree of level 5 has how many nodes ?
15
25
63
30
10. Traversing a binary tree first root and then left and right subtrees called _______traversal.
postorder
preorder
inorder
none of these
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
