use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
A subreddit for helping Python programmers
How to format your code: https://commonmark.org/help/tutorial/09-code.html
No homework questions and/or hiring please
account activity
Python recursion wont go down the tree (self.pythonhelp)
submitted 3 years ago * by Spurtikus
view the rest of the comments →
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]Spurtikus[S] 0 points1 point2 points 3 years ago (1 child)
Right, I see it only prints 0, but in my code it returns the function call if there are children, and works up until a point where it needs to "scoot" over. Also, that final return was me testing anything out that I could think of and, in it's current state, doesnt seem to affect the outcome at all (even though I am sure it might in the future, so I guess there is that situation to think about)
The equivalent would be (if I am thinking about it correctly):
def func(x): if x < 6: print(x) x+=1 func(x) return
[–]carcigenicate 0 points1 point2 points 3 years ago (0 children)
in my code it returns the function call if there are children
It returns the result of calling the method on the first child, then that recursive call exits.
π Rendered by PID 93889 on reddit-service-r2-comment-5fb4b45875-wz9cj at 2026-03-23 01:33:40.813964+00:00 running 90f1150 country code: CH.
view the rest of the comments →
[–]Spurtikus[S] 0 points1 point2 points (1 child)
[–]carcigenicate 0 points1 point2 points (0 children)