Question

Identify the reason which doesn’t play a key role to use threaded binary trees?

(a) The storage required by stack and queue is more

(b) The pointers in most of nodes of a binary tree are NULL

(c) It is Difficult to find a successor node

(d) They occupy less size

Question is taken from Binary Trees using Linked Lists in section Binary Trees of Data Structures & Algorithms I

I got this question in exam.

Answer 1

Right choice is (d) They occupy less size

Easiest explanation - Threaded binary trees are introduced to make the Inorder traversal faster without using any stack or recursion. Stack and Queue require more space and pointers in the majority of binary trees are null and difficulties are raised while finding successor nodes. Size constraints are not taken on threaded binary trees, but they occupy less space than a stack/queue.