0 votes 0 votes Consider the following array of elements $<70, 23, 60, 19, 13, 16, 1, 4, 8, 12, 7, 10, 85>$ The minimum number of interchanges needed to convert into a max-heap is $4$ $1$ $3$ $2$ DS uppcl2018 data-structures binary-heap + – admin asked Jan 5, 2019 retagged Apr 19, 2022 by Lakshman Bhaiya admin 448 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Answer C 3 It requires 3 interchange because only one node 85 insert at last create problem so first interchange with 16 Second with 60 and finally exchange with 70 To perform these interchange we apply max heapify operation Ram Swaroop answered Mar 8, 2019 edited Mar 8, 2019 by Ram Swaroop Ram Swaroop comment Share Follow See all 0 reply Please log in or register to add a comment.