ISRO CSE 2023

Detailed Explanation:

The inorder predecessor of a node is the maximum value in its left subtree.

The left subtree of node 15 has root 6.

Moving to the rightmost node in the left subtree: 6 -> 7 -> 13 (which has left child 9).

Detailed Explanation:

$Pointer arithmetic formula: p + n = address + n * sizeof(type).$

$Here address = 200, n = 3, element size = 2 Bytes.$

Detailed Explanation:

Elements in a priority queue are ordered by priority, not by insertion position.

Detailed Explanation:

Building a max-heap takes O(n) time.

Extracting n elements takes n * O(log n) = O(n log n) time.

Detailed Explanation:

Initial state: (X1=1, Y1=1).

Iteration 1: X2 = 1+1 = 2, Y2 = 2(1)+1 = 3.

$Iteration k: X_{k} = k, Y_{k} = 2^k - 1.$

For $X = 7, k = 7$.