Given a binary tree:
typedef struct node
{
int info;
struct node *left,*right;
}node;
How to implement a recursive function void heapify(node *root) to construct a max heap from a binary tree given above?
Asked
Active
Viewed 35 times
0
ufo
- 93
- 1
- 11
-
4Dup: https://stackoverflow.com/questions/24801613/max-heapify-a-binary-tree – 2501 Sep 20 '16 at 09:32
-
For each element in reverse-array order, sink it down. – David Ranieri Sep 20 '16 at 09:32