In heap sort, after deleting the last minimum element, the array will contain elements in?
(a) increasing sorting order
(b) decreasing sorting order
(c) tree inorder
(d) tree preorder
This question was posed to me in exam.
I would like to ask this question from Heapsort topic in chapter Sorting of Data Structures & Algorithms II