2011/1/14 kost BebiX <k...@ya.ru>: > Well, isn't tree is a root node and it's children?
And its grandchildren, great-grandchildren, etc. What Alex is saying is that the implementation you posted traverses the root and its immediate children, but does not recur any further than that. That is why it was so fast. -- http://mail.python.org/mailman/listinfo/python-list
