Data Structures

1: 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 threaded.