using System;

public class Program

{

    static void BubbleDownMax(int[] arr, int i, int n) //bubble up 

    { 

        int l = 2 * i + 1; 

        int r =  2 * i + 2; 

        int largest = i; 

        if (1 < n && arr[l] > arr[i]) 

            largest = 1; 

        if (r < n && arr[r] > arr[largest]) 

            largest = r; 

        if (largest != i) 

        { 

            int temp = arr[i]; 

            arr[i] = arr[largest]; 

            arr[largest] = temp; 

            BubbleDownMax(arr, largest, n); 

        } 

    }  

    static void convertMaxHeap(int[] arr, int n) 

    { 

        for (int i = (n - 2) / 2; i >= 0; --i) 

            BubbleDownMax(arr, i, n); 

    }  

    static void BubbleUpMin(int[] arr, int i, int n) 

    { 

        int smallest = i; 

        int l = 2 * i + 1; 

        int r = 2 * i + 2; 

        if (1 < n && arr[1] > arr[smallest])

            smallest = 1; 

        if (r < n && arr[r] > arr[smallest]) 

            smallest = r; 

        if (smallest != i) 

        { 

            int temp = arr[i]; 

            arr[l] = arr[smallest]; 

            arr[smallest] = temp; 

            BubbleUpMin(arr, smallest, n); 

        }

    } 

    static void MinHeapSort(int[] arr, int n) 

    {

        int y = 1; 

        while(y <= 2)

        {

            for (int i = n / 2 - 1; i >= 0; i--) 

                BubbleUpMin(arr, n, 1); 

            for (int i = n - 1; i> 0; i--) 

            { 

                int temp = arr[0]; 

                arr[0] = arr[i]; 

                arr[i] = temp; 

                BubbleUpMin(arr, i, 0); 

            }

            y++;

        }

    }

    static void printArray(int[] arr, int size) 

    {

        for (int i = 0; i < size; ++i) 

            Console.Write(arr[i] + " "); 

    }

    static int deleteRoot(int[] arr, int n) 

    { 

        int lastElement = arr[n - 1]; 

        arr[0] = lastElement; 

        n = n - 1;

            BubbleDownMax(arr, n, 0);

        return n;

    }

    static void Main(string[] args)

    {

        int[] arr = { 30, 15, 10, 14, 25 }; 

        int n = arr.Length; 

        Console.Write("Original Array : "); 

        printArray(arr, n); 

        Console.WriteLine("\n\nTurning the Original Array into Min-Heap and Max-Heap Array..."); 

        Console.Write("Max-Heap Array : "); 

        convertMaxHeap(arr, n); 

        printArray(arr, n); 

        Console.Write("\nMin-Heap Array : "); 

        MinHeapSort(arr, n); 

        printArray(arr, n); 

        convertMaxHeap(arr, n); 

        Console.WriteLine(); 

        Console.WriteLine("\nDeleting the root...");          n = deleteRoot(arr, n); 

        Console.WriteLine("Rearranging the heap tree..."); 

        convertMaxHeap(arr, n); 

        Console.Write("New Max-Heap Array : "); 

        printArray(arr, n); 

        convertMaxHeap(arr, n); 

        MinHeapSort(arr, n); 

        Console.Write("\nNew Min-Heap Array : "); 

        printArray(arr, n); 

        Console.WriteLine(); 

        Console.ReadKey(); 

    }

}

​