On Monday, December 27, 2021 at 7:10:15 AM UTC-6 [email protected] wrote: > There has to be an immense body of literature out there on tree traversal, > and much if not most of it probably does not depend on generators and > recursion.
The typical "algorithm" implies recursion. For example, you can describe depth first traversal as: - Visit the children. - Visit the node. The problem I'm trying to solve is to do implement this description iteratively. Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/leo-editor/aad735ca-cc2c-4376-b56a-f271d7ac75d4n%40googlegroups.com.
