You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tree. The tree $T$ follows the convention that, at each node, all values stored in the left subtree of the node are smaller than the value stored at the node. You are not aware of the sequence in which these values were inserted into $T$, and you do not have access to $T$.

Which one of the following statements is TRUE?

Consider a binary min-heap containing 105 distinct elements. Let *k* be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of *k* is

Consider the following statements.

S_{1} : The sequence of procedure calls corresponds to a preorder traversal of the activation tree.

S_{2} : The sequence of procedure returns corresponds to a postorder traversal of the activation tree.

Which one of the following options is correct?