The procedure given below is used to maintain min-order in the min heap. Find out the missing statements, represented as
Posted: Wed Jul 13, 2022 7:43 pm
a) if A[m] > A[parent(m)] then
swap A[m] and A[parent(m)]
b) if A[m] > A[parent(m)] then
swap A and A[parent(m)]
c) if A[m] < A[parent(m)] then
swap A[m] and A[parent(m)]
d) if A[m] > A[parent(m)] then
swap A and A[parent(m)]
swap A[m] and A[parent(m)]
b) if A[m] > A[parent(m)] then
swap A and A[parent(m)]
c) if A[m] < A[parent(m)] then
swap A[m] and A[parent(m)]
d) if A[m] > A[parent(m)] then
swap A and A[parent(m)]