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)]
The procedure given below is used to maintain min-order in the min heap. Find out the missing statements, represented as
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The procedure given below is used to maintain min-order in the min heap. Find out the missing statements, represented as
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!