MinHeap implementation in Java

I have made my own MinHeap in Java. I would like to get review comments on the same.

```
package heap.minheap;

public class MinHeap {

private int[] heap;
private int size;
private int maxSize;
private static final int FRONT = 1;

public MinHeap(int maxSize){
this.heap = new int[maxSize+1];
heap[0] = Integer.MIN_VALUE;
this.size = 0;
}

private int getParent(int position){
return position/2;
}

private int getLeftChild(int position){
return 2*position;
}

private int getRightChild(int position){
return 2*position+1;
}

private void swap(int position1, int position2){
int temp = heap[position1];
heap[position1] = heap[position2];
heap[position2] = temp;
}

private boolean isLeaf(int position){

if(position > size/2){
return true;
}
return false;
}

public void insert(int data){
heap[++size] = data;
int currentItem = size;
while( heap[getParent(currentItem)] > heap[currentItem] ){
swap(getParent(currentItem),currentItem);
currentItem = getParent(currentItem);
}
}

public int delete(){
int itemPopped = heap[FRONT];
heap[FRONT] = heap[size--];
heapify(FRONT);
return itemPopped;
}

private void heapify(int position){
if(isLeaf(position)){
return;
}

if ( heap[position] > heap[getLeftChild(position)] || heap[position] > heap[getRightChild(position)]){

if(heap[getLeftChild(position)] < heap[getRightChild(position)]){
swap(position , getLeftChild(position));
heapify(getLeftChild(position));
}
else{
swap(position , getRightChild(position));
heapify(getRightChild(position));
}
}
}

@Override
public String toString(){
StringBuilder output = new StringBuilder();
for(int i=1; i<= size/2; i++){
output.append("Parent :"+ heap[i]);
output.append("LeftChild : "+heap[getLeftChild(i)] +" RightChild :"+ heap[getRightChild(i)]).append("\n");
}
retu

Style

• Dead code should be removed. maxSize is never used.

-
Be consistent in your style. You should decide wether you use this. If a decision is made you should stick to it.

Here i would suggest refactor the constructor to

public MinHeap(int maxSize){
    heap = new int[maxSize+1];
    heap[0] = Integer.MIN_VALUE;
    size = 0;
}

Simplification

In the isLeaf() method you basically say if the condition is true, return true otherwise return false

private boolean isLeaf(int position){

    if(position > size/2){
        return true;
    }
    return false;
}

This can be simplified to return if the condition is true.

private boolean isLeaf(int position){
    return (position > size/2);
}

StackExchange Code Review Q#71536, answer score: 7