Path: csiph.com!usenet.pasdenom.info!news.albasani.net!newsfeed.freenet.ag!newsfeed.kamp.net!newsfeed.kamp.net!feeder1.cambriumusenet.nl!feed.tweaknews.nl!194.109.133.81.MISMATCH!newsfeed.xs4all.nl!newsfeed2a.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
Return-Path: <ian.g.kelly@gmail.com>
X-Original-To: python-list@python.org
Delivered-To: python-list@mail.python.org
X-Spam-Status: OK 0.015
X-Spam-Evidence: '*H*': 0.97; '*S*': 0.00; 'tree': 0.05; '21,': 0.07; 'element': 0.07; '22,': 0.09; 'lst': 0.09; 'jan': 0.12; 'suggest': 0.14; '[and': 0.16; 'empty.': 0.16; 'incomplete': 0.16; 'likewise': 0.16; 'node,': 0.16; 'elements': 0.16; 'thursday,': 0.16; 'wrote:': 0.18; 'wed,': 0.18; 'question': 0.24; 'header:In- Reply-To:1': 0.27; 'point': 0.28; 'message-id:@mail.gmail.com': 0.30; 'datum': 0.31; 'node': 0.31; 'text': 0.33; 'sense': 0.34; 'could': 0.34; 'case,': 0.35; 'definition': 0.35; 'but': 0.35; 'received:google.com': 0.35; 'should': 0.36; 'january': 0.37; 'list': 0.37; 'being': 0.38; 'driving': 0.38; 'to:addr:python- list': 0.38; 'fact': 0.38; 'pm,': 0.38; 'sure': 0.39; 'to:addr:python.org': 0.39; 'how': 0.40; 'even': 0.60; 'ian': 0.60; 'real': 0.63; '20,': 0.68; 'containing': 0.69; '2015': 0.84; '"how': 0.91; 'contents.': 0.91
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type:content-transfer-encoding; bh=pTHzTkoL4YpgermBIfMSnBZEJaxja+Vf2xwh/ihT51o=; b=jhPhdC9om8IOdqWzoHye2WV2081SnpYIWf3G3OqtwyMP254IhXDtUc3ttTnek7pu5w rdubHxxEJwyyJQr2V/X9V0/rdDTQkByIzOSfUeuw7F8lC0NFrctLxnkhz411M3fTBJ3f khi+eLLbqsaNvs4JXVYr+UVHI2Z6MGgOoGyqI5vQyCUv2Uw9suAoTQzrwXhzRRC6i3E2 /oodQIXeJbgDS6UJJt1m0rTS5kX8+U8V08sCd0a2RqXKN9O+u2eS6yj27n6rUMdErUsQ iccf6oGWs9loM2IjZf7cbUPEpYmbsIN9DxtzENIO02+GeW99evsvmY+gq7kVS8SRoSBI ylhA==
X-Received: by 10.68.237.2 with SMTP id uy2mr58188161pbc.72.1421909804370; Wed, 21 Jan 2015 22:56:44 -0800 (PST)
MIME-Version: 1.0
In-Reply-To: <f15dfb47-d16e-49dd-b3b9-5905c9004a78@googlegroups.com>
References: <CAG=hEY1L-39EmuWpdEh_n-BNfs=qG9nL=MrMT0ar72yGBrkoUA@mail.gmail.com> <mailman.17884.1421734095.18130.python-list@python.org> <d34dbfbe-fe82-47dc-8bc3-c8773e2b70dd@googlegroups.com> <MPG.2f28eb55d73ef68c989680@nntp.aioe.org> <ba69cad8-68c0-421e-af79-e381ca179015@googlegroups.com> <mailman.17927.1421880891.18130.python-list@python.org> <f15dfb47-d16e-49dd-b3b9-5905c9004a78@googlegroups.com>
From: Ian Kelly <ian.g.kelly@gmail.com>
Date: Wed, 21 Jan 2015 23:56:03 -0700
Subject: Re: Trees
To: Python <python-list@python.org>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
X-BeenThere: python-list@python.org
X-Mailman-Version: 2.1.15
Precedence: list
List-Id: General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe: <https://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive: <http://mail.python.org/pipermail/python-list/>
List-Post: <mailto:python-list@python.org>
List-Help: <mailto:python-list-request@python.org?subject=help>
List-Subscribe: <https://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups: comp.lang.python
Message-ID: <mailman.17956.1421910194.18130.python-list@python.org>
Lines: 29
NNTP-Posting-Host: 2001:888:2000:d::a6
X-Trace: 1421910194 news.xs4all.nl 2856 [2001:888:2000:d::a6]:39158
X-Complaints-To: abuse@xs4all.nl
Xref: csiph.com comp.lang.python:84202

On Wed, Jan 21, 2015 at 10:20 PM, Rustom Mody <rustompmody@gmail.com> wrote=
:
> On Thursday, January 22, 2015 at 4:25:03 AM UTC+5:30, Ian wrote:
>> On Tue, Jan 20, 2015 at 6:23 PM, Rustom Mody wrote:
>> > The Haskell is bullseye=C2=B9 in capturing the essense of a tree becau=
se
>> > conceptually a tree of type t is recursive in the sense that it can co=
ntain
>> > 2 subtrees -- (B x lst rst) -- or its a base case -- L x.
>>
>> How do you create a tree containing an even number of elements under
>> this constraint?
>
> Not sure what you are asking...
>
> [And a text only group makes discussing pictur-esque things hard]
> What do you mean by 'element'?
> Leaf? Internal? Either?

By "element" I mean an individual datum contained in the tree.
Likewise the elements of a list are its contents.

Since each element is associated with a node, the question could
equally be phrased as "How do you create a tree containing an even
number of elements under this constraint?" The point I was driving at
is that the definition is incomplete -- in addition to being an
internal node or a leaf, a tree can also be empty. In fact I would
suggest that an empty tree should be the real base case, since what is
a leaf node but a node where both of its children are empty trees?