void   MAX_HEAPIFFY(int i){
        int l=getLeft(i);
        int r=getRight(i);
        int largest;
        if(l>=0 && l<=heapSize-1 && nodeList[l]>nodeList[i]){
            largest= l;

        }else{
            largest= i;

        }
        if(r>=0 && r<=heapSize-1 && nodeList[r]>nodeList[largest]){
            largest= r;

        }
        if(largest!=i){
            int temp=nodeList[largest];
            nodeList[largest]=nodeList[i];
            nodeList[i]=temp;
            MAX_HEAPIFFY( largest);

        }


    }