Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!newsreader4.netcologne.de!news.netcologne.de!takemy.news.telefonica.de!telefonica.de!newsfeed.xs4all.nl!newsfeed2.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.039 X-Spam-Evidence: '*H*': 0.93; '*S*': 0.00; 'tree': 0.05; '21,': 0.07; 'element': 0.07; 'jan': 0.12; 'node,': 0.16; 'elements': 0.16; 'wrote:': 0.18; 'wed,': 0.18; 'meant': 0.20; 'question': 0.24; 'header:In-Reply-To:1': 0.27; 'message-id:@mail.gmail.com': 0.30; 'there,': 0.34; 'could': 0.34; 'received:google.com': 0.35; 'to:addr:python-list': 0.38; 'pm,': 0.38; 'to:addr:python.org': 0.39; 'even': 0.60; 'ian': 0.60; 'course': 0.61; 'containing': 0.69; '2015': 0.84; '"how': 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; bh=pXdxMpRnbmJNuOJhuy5F4DySkxpzn0+t6whg0gWY1aU=; b=cVFJOiH9qOZhXuAWxidRQkoIt31uXFDskPfduECBKEaGNj6WpT/fVspbn9FXw9IEng 5el9fOfEbpVIOtNltYA3m6EJ4njp+a8SenUxxs2Fcq7ZPXDmXRPLfSjaOh3q5NTHyNy+ LKq5dQH+nLfusxeVd7rS7HpLTRbk89OAxd6AnAh6QZEgs/tvEX3IdtewJD/B5rl5ofzh 8zB45hHKt/zMq4ivej7Yy/8c/mo9VlE4HudYwt+sho7h1pt7TWgdxJ+lcWGskpGcerlW 7DBZgdFvwyTWtVZ20JivLFSZt1DIhacTz29Rag1k88AZoLnsaO64L5XsnN35pwqLAFYP D18w== X-Received: by 10.66.66.166 with SMTP id g6mr69756874pat.88.1421910125426; Wed, 21 Jan 2015 23:02:05 -0800 (PST) MIME-Version: 1.0 In-Reply-To: References: From: Ian Kelly Date: Thu, 22 Jan 2015 00:01:25 -0700 Subject: Re: Trees To: Python Content-Type: text/plain; charset=UTF-8 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: 6 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1421910128 news.xs4all.nl 2911 [2001:888:2000:d::a6]:37815 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:84201 On Wed, Jan 21, 2015 at 11:56 PM, Ian Kelly wrote: > 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?" Of course I meant to write "nodes" there, not "elements".