Question

A threaded binary tree is a binary tree in which every node that does not have right child has a thread to its _______.

• A. Pre-order successor
• B. In-order successor
• C. In-order predecessor
• D. Post-order successor

Hint:

In threaded binary trees, threads are used to link nodes for faster traversal without the overhead of recursion or stack operations.

Answer 1

The Correct Option is B

In a threaded binary tree, if a node does not have a right child, it has a thread pointing to its in-order successor. This threading mechanism helps in efficient in-order traversal without the need for recursion or a stack. The other options are incorrect because they refer to traversal orders that are not relevant to the threading of the right child.