info@avatto.com
+91-9920808017
0. Which of the following statements are correct? I. If each tree node contains a father field, then it's not necessary to use either stack or threads II. Traversal using father pointers is more time-efficient than traversal of a threaded tree III. An in-threaded binary tree is defined as a binary tree that is both left-in threaded and right-in threaded.
II and III
I and III
I and II
None of these
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
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
