Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!newsfeed.xs4all.nl!newsfeed1a.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.092 X-Spam-Evidence: '*H*': 0.83; '*S*': 0.01; 'tree': 0.05; 'lst': 0.09; 'jan': 0.12; 'elements': 0.16; 'wrote:': 0.18; 'header:In-Reply- To:1': 0.27; 'message-id:@mail.gmail.com': 0.30; 'sense': 0.34; 'received:google.com': 0.35; 'to:addr:python-list': 0.38; 'pm,': 0.38; 'to:addr:python.org': 0.39; 'how': 0.40; 'even': 0.60; '20,': 0.68; 'containing': 0.69; '2015': 0.84 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=y2CFEuxj71WsDYEfR7wV3Y9byH/1TDU5pUzC1SLxaoY=; b=nGv/opHsAQYRF4LY7piGwMTTbaxQMSe7QfWzo7yZe5gVW1ygVqoVfioy3In+aLRERC N8ta/8r/6IGSq34wzn3c38o64OHDp1u/mBqULC0VXqAvlJatmd+uGFBh0JMh8DG/N5w9 U8NrK6ywNCwX9v8BkKOQ/d2VpiVO4AzffYYw8VH/wxRBMU57vFv4e51k7Kuq2VBMiwen 6aVea5DMp/ImWA7fdb+81EErjmWwVNvsWPW1/t2drfMSyL3++HIMW3NKs/jUoY1XehaI HS2VJQldICDoLOCA99bK9yW3n50i7G9cXGS1Ltcq0B2/1SgB20MeacZLjQVu69cGaWE8 KhEQ== X-Received: by 10.70.91.142 with SMTP id ce14mr67005625pdb.138.1421880888709; Wed, 21 Jan 2015 14:54:48 -0800 (PST) MIME-Version: 1.0 In-Reply-To: References: From: Ian Kelly Date: Wed, 21 Jan 2015 15:54:08 -0700 Subject: Re: Trees To: Python 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 List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 8 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1421880891 news.xs4all.nl 2963 [2001:888:2000:d::a6]:57079 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:84151 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 because > conceptually a tree of type t is recursive in the sense that it can conta= in > 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?