Micah enlightened us with:
> I'm looking for a simple tree implementation: 0-n children, 1 root.
> All the nice methods would be appreciated (getLeaves, isLeaf,
> isRoot, depthfirst, breadthfirst,...) That's really all I need. I
> could code one up, but it would take time to debug, and i'm really
> short on time right now.
What kind of tree do you want? B+-tree? Black/Red tree? Binary search
tree?
Sybren
--
The problem with the world is stupidity. Not saying there should be a
capital punishment for stupidity, but why don't we just take the
safety labels off of everything and let the problem solve itself?
Frank Zappa
--
http://mail.python.org/mailman/listinfo/python-list
