Best structure for (binary) trees?

[Rasmus]

Hi.

As partly novice in python I would like a piece of advise of how to
implement (binary) trees the best way?

Thanks in advance,

Rasmus

PS: Due to heavy spam reception (20.000+/week), I use a fake sender address.
Please answer in the newsgroup. Thanks

 

[Fredrik Lundh]

As partly novice in python I would like a piece of advise of how to
implement (binary) trees the best way?

if you're 100% sure you cannot use a standard dictionary, the best
way is probably to get ZODB and use its BTrees module...

code:

http://www.zope.org/Products/ZODB3.2

introduction:

http://zope.org/Wikis/ZODB/FrontPage/guide/node6.html

</F>

 

[Aahz]

As partly novice in python I would like a piece of advise of how to
implement (binary) trees the best way?

Assuming that nodes also contain data:

class Node:
def __init__(self, data):
self.data = data
self.left = self.right = None

Assuming that you're a CS student looking for homework help, I'll leave
the rest of the implementation as an exercise. You might also consider
looking at the bisect module.

 

[Alan Kennedy]

[Rasmus]

As partly novice in python I would like a piece of advise of how to
implement (binary) trees the best way?

The original Python Enhancement Proposal (PEP) for Generators (a
recently introduced feature of the python language), PEP-255, contains
a nice example of building and navigating binary trees.

http://www.python.org/peps/pep-0255.html

Search for the text "binary tree class" on that page. That should give
you sufficient sample code to play with.

If you're able to follow the generator/yield -based examples, I'd be
so bold as to say that that is "the best way".

regards,

 

[Rasmus]

Thanks to all of you.
I have found several good answers of implementing trees from your postings.

R