Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #38880 > unrolled thread
| Started by | Gary Herron <gherron@digipen.edu> |
|---|---|
| First post | 2013-02-14 11:36 -0800 |
| Last post | 2013-02-14 11:36 -0800 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Binary tree implementation Gary Herron <gherron@digipen.edu> - 2013-02-14 11:36 -0800
| From | Gary Herron <gherron@digipen.edu> |
|---|---|
| Date | 2013-02-14 11:36 -0800 |
| Subject | Re: Binary tree implementation |
| Message-ID | <mailman.1782.1360870925.2939.python-list@python.org> |
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
Back to top | Article view | comp.lang.python
csiph-web