Micah wrote: > 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. > > Thanks! > Micah >
http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/136529 -- http://mail.python.org/mailman/listinfo/python-list
