John wrote:
> I solved it myself.
> Don't bother.
Heh heh, I don't think they were going to anyway.
--
http://mail.python.org/mailman/listinfo/python-list
On 2007-02-07, John <[EMAIL PROTECTED]> wrote:
> 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
I solved it myself.
Don't bother.
"John" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> 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
John wrote:
> 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 ?
--
http://mail.python.org/mailman/listinfo/python-list
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
--
http://mai
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://mail.python.org/mailman/listinfo/python-list
