+1 vote
in Data Structures & Algorithms I by (110k points)
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

My doubt is from Threaded Binary Tree in chapter Binary Trees of Data Structures & Algorithms I

I got this question by my college director while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (a) inorder predecessor for left node and inorder successor for right node information

The best I can explain: If preorder or postorder is used then the respective predecessor and successor info is stored.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...