I need to call functions recursively in tree structure.
Below is the image for example tree structure.
here I am calling the python function in in for loop by passing A
, this will produce the output B
in first loop and C
in second loop.
here I need to run the same function for B
and C
, so here B
will generate D
and E
and C
will generate F
and next Run same python function for D
it will generate G
so on, I have to run the same until I get null.
How can I write the logic in python
-
possible answer stackoverflow.com/questions/15524902/…stormfield– stormfield2019年02月16日 12:41:26 +00:00Commented Feb 16, 2019 at 12:41
1 Answer 1
There are better ways depending on the end goal really but this basic recursive function will traverse your whole tree.
def get_children(node):
for child in node:
get_children(child)
This structure will go all the way down the left branches of the tree first though. Might be worth noting.
Explore related questions
See similar questions with these tags.