The Coq mailing list

[roconnor AT theorem.ca]

On Fri, 16 Dec 2005 
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?  Perhaps
> more importantly, is there a way to deduce such a function?

By complete binary tree I mean
<http://www.nist.gov/dads/HTML/completeBinaryTree.html>

but I think I would also be satified with a perfect binary tree
<http://www.nist.gov/dads/HTML/perfectBinaryTree.html>

-- 
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.''