> For the complete documentation index, see [llms.txt](https://nitinranganath.gitbook.io/data-structures/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://nitinranganath.gitbook.io/data-structures/heap/heapify.md).

# Heapify

### Max Heapify :

```c
void maxHeapify(int h[], int index, int size) {

    // Set largest as parent and set children
    int left = 2 * index;
    int right = 2 * index + 1;
    int largest = index;
    
    // If left child is greater, make largest point to it
    if (left <= size && h[left] > h[largest])
        largest = left;
    
    // If right child is greater, make largest point to it
    if (right <= size && h[right] > h[largest])
        largest = right;
        
    // If largest is not parent, swap it with passed index
    if (largest != index) {
        int temp = h[index];
        h[index] = h[largest];
        h[largest] = temp;
        maxHeapify(h, largest, size);
    }
    return;

}
```

### Min Heapify :

```c
void minHeapify(int h[], int index, int size) {

    // Set smallest as parent and set children
    int left = 2 * index;
    int right = 2 * index + 1;
    int smallest = index;
    
    // If left child is smaller, make smallest point to it
    if (left <= size && h[left] < h[smallest])
        smallest = left;
    
    // If right child is smaller, make smallest point to it
    if (right <= size && h[right] < h[smallest])
        smallest = right;
        
    // If smallest is not parent, swap it with passed index
    if (smallest != index) {
        int temp = h[index];
        h[index] = h[smallest];
        h[smallest] = temp;
        minHeapify(h, smallest, size);
    }
    return;

}
```

**Note:** To build a max heap or min heap, run the function n/2 times . Like this :

```c
for (int i = size/2; i >= 1; i--) {
    maxHeapify(heap,i,size);
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/heap/heapify.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.