Re: binary trees in arrays

[Robin Houston]

On Thu, Sep 06, 2001 at 05:57:05AM -0500, David L. Nicol wrote:
> [...] the elegant method of storing binary trees in arrays [...]

It's the usual way to implement heapsort, among other things.
One Perl implementation of heapsort, using this technique, is at:

http://www.bagley.org/~doug/shootout/bench/heapsort/heapsort.perl


A CPAN heapsort implementation is (oddly) in
http://www.perldoc.com/cpan/Graph/Kruskal.html,
though I haven't looked at the implementation.

 .robin.