What points to higher node in a threaded binary tree ?OptionsRootsThreadsChildInfo

In the context of a threaded binary tree, the correct answer is Threads.

Explanation:

1. Definition of Threaded Binary Tree: A threaded binary tree is a type of binary tree that makes use of the null pointers (typically in the leaves) to point to the in-order predecessor and successor nodes. This is done to efficiently facilitate in-order traversal without using a stack or recursion.

2. Understanding the Options:

   • Roots: This term usually refers to the main node of the tree, where every element branches out. It doesn't directly point to a higher node in the context of threading.
   • Threads: In a threaded binary tree, threads provide direct links to in-order predecessor and successor nodes, thus allowing traversal in a straightforward manner. Hence, they can be seen as pointers that reference higher or succeeding nodes.
   • Child: This typically refers to the immediate nodes that branch out from any parent node but does not imply any connection to higher nodes.
   • Info: This is a vague term and doesn't pertain specifically to nodes or traversals.

Thus, in a threaded binary tree, the threads effectively allow access to higher nodes through their direct connections.