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.