Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Making a List into a Tree with Structural Recursion

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Making a List into a Tree with Structural Recursion


chronological Thread 
  • From: roconnor AT theorem.ca
  • To: Coq Club <coq-club AT pauillac.inria.fr>
  • Subject: Re: [Coq-Club] Making a List into a Tree with Structural Recursion
  • Date: Fri, 16 Dec 2005 09:57:34 -0500 (EST)
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

On Fri, 16 Dec 2005 
roconnor AT theorem.ca
 wrote:

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

Er, I don't mean a perfect binary tree,  What a wanted to say is that all
the extra leaves don't need to be to the left.  So long as all leaves are
at either depth n or depth n-1, I am happy.

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




Archive powered by MhonArc 2.6.16.

Top of Page