Unable to understand this recursive turtle python code
问题 this is my first time asking a question, I hope some of you will find time to answer. So my goal is to write a python script using the turtle module to code a pythagoras tree. I've spent days on it, and I really couldn't advance past a certain point, so I looked online to help me. I've found a code that does what I want but with very little lines of code: import turtle t = turtle.Pen() LIMIT =11 SCALAR = 0.5 * (2 ** 0.5) def drawTree(size, depth): drawSquare(size) if depth + 1 <= LIMIT: t