What are null nodes filled with in a threaded binary tree? – McqOptions

MCQOPTIONS

1.	What are null nodes filled with in a threaded binary tree?
A.	inorder predecessor for left node and inorder successor for right node information
B.	right node with inorder predecessor and left node with inorder successor information
C.	they remain null
D.	some other values randomly
Answer» B. right node with inorder predecessor and left node with inorder successor information

Discussion

No Comment Found

Related MCQs

What is inefficient with the below threaded binary tree picture?
What is wrong with below code for inorder traversal of inorder threaded binary tree:
Which of the following tree traversals work if the null left pointer pointing to the predecessor and null right pointer pointing to the successor in a binary tree?
In general, the node content in a threaded binary tree is ________
inordersuccessor instead of inorderpredecessor must be don?
What are double and single threaded trees?
The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?
What are null nodes filled with in a threaded binary tree?
What may be the content of a node in threaded binary tree?
What are the disadvantages of normal binary tree traversals?