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.