Path: csiph.com!usenet.pasdenom.info!aioe.org!news.stack.nl!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!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.007 X-Spam-Evidence: '*H*': 0.99; '*S*': 0.00; 'python.': 0.02; 'binary': 0.05; 'newbie': 0.05; 'things.': 0.05; 'suppose': 0.07; 'python': 0.09; 'both,': 0.16; 'hint:': 0.16; 'hint?': 0.16; 'nodes': 0.16; 'stated,': 0.16; 'wrote:': 0.17; 'question.': 0.20; 'all,': 0.21; 'subject:skip:i 10': 0.22; 'header:In-Reply-To:1': 0.25; 'header :User-Agent:1': 0.26; 'am,': 0.27; 'language.': 0.27; 'tree': 0.27; 'this?': 0.28; 'gary': 0.29; "i'm": 0.29; 'code': 0.31; 'anybody': 0.32; 'help,': 0.32; 'to:addr:python-list': 0.33; 'really': 0.36; 'but': 0.36; 'thank': 0.36; 'does': 0.37; 'previous': 0.37; 'subject:: ': 0.38; 'received:10': 0.38; 'science': 0.38; 'to:addr:python.org': 0.39; 'help': 0.40; 'your': 0.60; 'different': 0.63; 'more': 0.63; 'quality': 0.69; 'dr.': 0.72; 'institute': 0.72; 'received:204': 0.72; 'received:10.10': 0.75; 'subject:tree': 0.84 Date: Thu, 14 Feb 2013 11:36:48 -0800 From: Gary Herron User-Agent: Mozilla/5.0 (X11; Linux i686; rv:17.0) Gecko/20130106 Thunderbird/17.0.2 MIME-Version: 1.0 To: python-list@python.org Subject: Re: Binary tree implementation References: In-Reply-To: Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit 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: 40 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1360870925 news.xs4all.nl 6971 [2001:888:2000:d::a6]:53589 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:38880 On 02/14/2013 11:18 AM, Megha Agrawal wrote: > Hello All, > > I am a newbie to python language. I need your help in implementation > of Binary tree in python. I have a count of nodes and I need to draw a > binary tree. Suppose if count is 5 then tree will look like > 1 > / \ > / \ > 2 3 > / \ > / \ > 4 5. > > Does anybody have code for this? Or any hint? I'm confused! Do you need to *implement* a binary tree or *draw* a binary tree. You say both, but those are very different things. Hint: If you want quality (volunteer) help, please put more time into the quality of your question. As it is stated, we really don't know what you want help with. Gary Herron > > > PS: Sorry for previous mail !! > > Thank you :) > > -- Dr. Gary Herron Department of Computer Science DigiPen Institute of Technology (425) 895-4418