66) A 3-ary tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 6 internal nodes will be

67) A complete binary tree of level 5 has how many nodes ?

68) Traversing a binary tree first root and then left and right sub-trees called _______traversal.

69) A binary tree having n nodes and depth d will be about complete binary tree if

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.