62) A complete binary tree with the property that the value at each node is at least as large as the values at its children is called

63) A full binary tree with n leaves contains

64) A full binary tree with n non-leaf nodes contains

65) If this tree is used for sorting, then new no 8 should be placed as the

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