The Coq mailing list

[roconnor AT theorem.ca]

On Fri, 16 Dec 2005, Lionel Elie Mamane wrote:

> On Fri, Dec 16, 2005 at 07:38:20AM -0500, 
> roconnor AT theorem.ca
>  wrote:
>
> > Does anyone know of a nice way of converting a list into a complete
> > binary tree using structural recursion such that the order is
> > preserved?
>
> Theoretically, here's how I'd do it.

I didn't follow it entirely, but it doesn't seem like O(n).  Am I wrong?
I think being O(n) is one of the requirements of a ``nice'' way. :-)

I'm guessing that the nice way will use functions in the same way that the
nice way of converting trees into lists does.

-- 
Russell O'Connor                                      <http://r6.ca/>
``All talk about `theft,''' the general counsel of the American Graphophone
Company wrote, ``is the merest claptrap, for there exists no property in
ideas musical, literary or artistic, except as defined by statute.''