Consider the array A = <4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are___ and _ respectively. (Root is at level 0).

Question

Question

This question was previously asked in

UGC NET Computer Science (Paper 2) July 2018 Paper

Attempt Online

Answer 1

Concept:

Max- heap: In max - heap, root node is always is greater than or equal to the other nodes of the tree.

Explanation:

A = <4, 1, 3, 2, 16, 9, 10, 14, 8, 7>.

STEP 1

F2 R.S Madhu 13.04.20 D1

Now, As 2 is greater than 1, there is need of rearrangement of nodes.

STEP 2:

F2 R.S Madhu 13.04.20 D2

Again exchange 16 with 2. Insert remaining nodes as per the property of max- heap.

STEP 3:

F2 R.S Madhu 13.04.20 D3

STEP 4:

F2 R.S Madhu 13.04.20 D4

STEP 5:

After inserting all the nodes in this way, final max - heap is:

F2 R.S Madhu 13.04.20 D5

As, root is at level 0, So, there are total 3 levels in this max - heap. Also, right child of root node is 10.