+1 vote
in Data Structures & Algorithms I by (110k points)
What are the disadvantages of normal binary tree traversals?

(a) there are many pointers which are null and thus useless

(b) there is no traversal which is efficient

(c) complexity in implementing

(d) improper traversals

My enquiry is from Threaded Binary Tree in chapter Binary Trees of Data Structures & Algorithms I

The question was asked in an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (a) there are many pointers which are null and thus useless

The best I can explain: As there are majority of pointers with null value going wasted we use threaded binary trees.

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

...