#include <stdio.h>
int leftChildIndex(int index) {
return 2 * index + 1;
}
int rightChildIndex(int index) {
return 2 * index + 2;
}
void maxHeapify(int* completeBinaryTreeArr, int size) {
}
#include <stdio.h>
int leftChildIndex(int index) {
return 2 * index + 1;
}
int rightChildIndex(int index) {
return 2 * index + 2;
}
void maxHeapify(int* completeBinaryTreeArr, int size) {
}