The Procedure Given Below Is Used To Maintain Minorder In The #1001

The procedure given below is used to maintain min-order in the min heap. Find out the missing statements, represented as X.</p> <pre><code class="language-c"> procedure TrickleDownMin(i) if A[i] has children then m := index of smallest of the children or grandchildren (if any) of A[i] if A[m] is a grandchild of A[i] then if A[m] < A[i] then swap A[i] and A[m] X: _______________________ ____________________ endif TrickleDownMin(m) endif else //{A[m] is a child of A[i]} if A[m] < A[i] then swap A[i] and A[m] endif endif </code></pre>

This multiple choice question (MCQ) is related to the book/course gs gs121 Data Structures and Algorithms. It can also be found in gs gs121 Heap - Min/Max Heap - Quiz No.1.

 procedure TrickleDownMin(i) if A[i] has children then m := index of smallest of the children or grandchildren (if any) of A[i] if A[m] is a grandchild of A[i] then if A[m] < A[i] then swap A[i] and A[m] X: _______________________ ____________________ endif TrickleDownMin(m) endif else //{A[m] is a child of A[i]} if A[m] < A[i] then swap A[i] and A[m] endif endif