最小二叉树堆排序怎么利用java 实现

 private int[] getMinBinaryHeap(int[] array){   int N = array.length;   int minBinaryHeap[] = new int[N];   int root;//根的值   int heapSize = 0;//记录插入位置   for(int num : array){     minBinaryHeap[heapSize]=num;     ++heapSize;     int pointer = heapSize-1;//当前指向的数组元素位置     while(pointer!=0){       int leafPointer = pointer;//叶子节点位置       pointer = (pointer-1)/2;//根节点位置       root = minBinaryHeap[pointer];//根节点       if(num>=minBinaryHeap[pointer]){//永远把当前数组元素看成叶子与其根比较或者换位         break;       }//如果根比叶子大 就交换位置       minBinaryHeap[pointer] = num;       minBinaryHeap[leafPointer] = root;            }   }   return minBinaryHeap;    }