private int heapify(int node, int heapSize){
		int largestIndex = node;
		if(tree.getLeftIndex(node) < heapSize ){
			if(tree.hasLeftChild(node) && tree.getLeftValue(node) > array[largestIndex]){
				largestIndex = tree.getLeftIndex(node);
			}
	
			if(tree.hasRightChild(node) && tree.getRightIndex(node) < heapSize){
				if(tree.getRightValue(node) >  array[largestIndex]){
					largestIndex = tree.getRightIndex(node);
				}
			}
		}
		
		return largestIndex;

	}