+1 vote
in Data Structures & Algorithms I by (110k points)
What is a threaded binary tree traversal?

(a) a binary tree traversal using stacks

(b) a binary tree traversal using queues

(c) a binary tree traversal using stacks and queues

(d) a binary tree traversal without using stacks and queues

Origin of the question is Threaded Binary Tree topic in chapter Binary Trees of Data Structures & Algorithms I

The question was posed to me during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (d) a binary tree traversal without using stacks and queues

For explanation: This type of tree traversal will not use stack or queue.

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

...