61) A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

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