dummy page

Time Complexity: O(n)

• The time complexity for converting a min heap to a max heap is O(n), where n is the number of elements in the heap.

Auxiliary Space: O(log n)

• The space complexity for converting a min heap to a max heap is O(log n), where n is the number of elements in the heap because the stack follows the recursion technique.