Is it required always Heapify the heap,when we represent it as an array is it an heapified representation or not?
It has to be a heapified, else how can you state that the given data structure is a Heap. For a data structure to be classified as a Heap, it must satisfy the properties of a Heap. So, if the Heap doesn't follow th properties of a heap, it has to be heapified.
If we heapify after deletion and store max deleted element then we get sorted array.
You get the sorted array once you've done deletion of Max element form the heap and applied heapify n/2 no. of times( n being the length of array to be sorted).
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order.Is this true?
Can you state the page no. where this is written.