+1 vote
in Data Structures & Algorithms I by (110k points)
What is inefficient with the below threaded binary tree picture?

(a) it has dangling pointers

(b) nothing inefficient

(c) incorrect threaded tree

(d) space is being used more

My question comes from Threaded Binary Tree in portion Binary Trees of Data Structures & Algorithms I

This question was posed to me in an interview for internship.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (a) it has dangling pointers

Easy explanation - The nodes extreme left and right are pointing to nothing which could be also used efficiently.

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

...