70) 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.

71) A binary tree of depth d is an almost complete binary tree if

72) If each node in a tree has value greater the every value in its left sub-tree and has value less than every value in its right sub-tree, the tree is called

73) The number of nodes in a complete binary tree of level 5 is

74) The maximum number of nodes on level i of a binary tree is