Which of the following statements are correct ?
I. If each tree node contains a father field, then it's not necessary to use either stack or threads
II. Traversal using father pointers is more time efficient than traversal of a threaded tree
III. A in-threaded binary tree is defined as binary tree that is both left-in threaded and right-in
data structure mcq questions with answers ,Data Structure Multiple Choice Questions and Answers , Data Structure MCQ with explanation, Data Structure Questions Answers , Data Structure Objective Type Questions Answers, This Section covers multiple choice questions answers in Data Structures that can be used for UGC NET Computer Science, GATE Computer Science , Computer Engineering , PSU , IES , Phd Entrance Exam , Pre Phd Entrance Exam and other competitive Exams. Data structures mcq questions with answers, Data structure using C, Data Structure in C