Can somebody give me a python code for this?

[hg]

Given an array of elements, look at it as a binary tree. Start at the last
interior node, and downheap it. Then downheap the previous interior node,
and continue in this fashion, up to the root.

Your teacher ?

 

[John]

Given an array of elements, look at it as a binary tree. Start at the last
interior node, and downheap it. Then downheap the previous interior node,
and continue in this fashion, up to the root.

 

[John]

I solved it myself.
Don't bother.

 

[Bruno Desthuilliers]

John a écrit :

Given an array of elements, look at it as a binary tree. Start at the last
interior node, and downheap it. Then downheap the previous interior node,
and continue in this fashion, up to the root.

http://www.catb.org/~esr/faqs/smart-questions.html#homework

 

[Grant Edwards]

Given an array of elements, look at it as a binary tree. Start
at the last interior node, and downheap it. Then downheap the
previous interior node, and continue in this fashion, up to
the root.

I'll give you python code for that if you give me your degree
in the remotely possible case where you do graduate...

 

[John Salerno]

I solved it myself.
Don't bother.

Heh heh, I don't think they were going to anyway.