> For the complete documentation index, see [llms.txt](https://gl01.gitbook.io/gfg-editorials/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://gl01.gitbook.io/gfg-editorials/2024/02-2024-feb-14/17-does-array-represent-heap.md).

# 17. Does array represent Heap

The problem can be found at the following link: [Question Link](https://www.geeksforgeeks.org/problems/does-array-represent-heap4345/1)

## My Approach

* We iterate through each non-leaf node of the binary tree represented by the array.
* For each node, we check if it violates the heap property. If it does, we return false.
* If we reach the end of the loop without finding any violations, we return true.

## Time and Auxiliary Space Complexity

* **Time Complexity** : O(n), where n is the number of elements in the array. We iterate through each non-leaf node once.
* **Auxiliary Space Complexity** : O(1), no extra space is used.

## Code (C++)

```cpp
class Solution {
public:
    bool isMaxHeap(int arr[], int n)
    {
        int st = n / 2;
        for(int i = st; i >= 0; --i){
            if((i*2 + 1 < n && arr[i] < arr[i*2 + 1]) || (i*2 + 2 < n) && arr[i] < arr[i*2 + 2])
                return false;
        }
        return true;
    }
};
```

## Contribution and Support

For discussions, questions, or doubts related to this solution, please visit our [discussion section](https://github.com/getlost01/gfg-potd/discussions). We welcome your input and aim to foster a collaborative learning environment.

If you find this solution helpful, consider supporting us by giving a `⭐ star` to the [getlost01/gfg-potd](https://github.com/getlost01/gfg-potd) repository.