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.