> > I'm toying with the idea of converting an existing LISP system into
    > > Python.  The system uses a lot of real trees, I mean, more deep than
    > > wide on average.

    Paul>  If it's a binary tree that's reasonably balanced, the usual
    Paul>  representation is a linear array like in the heapsort algorithm.

Funny thing.  A heap module was added to the standard library in the past
week or two.

Skip

-- 
http://mail.python.org/mailman/listinfo/python-list