Hey guys, I'm having a doubt on min-heaps I thought you could help.
I'm supposed to write a function that tests if a min-heap is well constructed, by other words, if all the sequences of numbers from the root till the last leaf are increasing.
My struct is as following :
Any help ?Code:typedef struct minheap { int values[]; int used; int size; } *MinHeap;
I thought about going from i=0 till i = used but that would only search one one way I think :/