python递归函数画树_Tu中绘制树的递归函数

我试着用递归函数画一棵树。这是我最好的机会。我知道我离得很远，但在努力解决它时遇到了困难。任何帮助都将不胜感激！在def svTree( trunkLength, levels ):

""" uses the turtle drawing functions to return a tree with a specified number of levels

input: two integers, trunkLength and levels

"""

newtrunkLength = trunkLength *.5

if levels ==1:

penup()

else:

forward(trunkLength)

left(45)

svTree(trunkLength * 0.5,levels -1)

right(90)

forward(trunkLength *.5)

svTree(trunkLength * 0.5,levels -1)

left(45)

backward(trunkLength)

forward(trunkLength)

right(45)

svTree(trunkLength * 0.5,levels -1)

left(90)

svTree(trunkLength * 0.5,levels -1)

right(45)

backward(trunkLength)

return svTree(newtrunkLength,levels -1)

这是我对它的新尝试：我认为它更接近于Y，但我认为我的递归步骤有缺陷。。。请帮忙！谢谢您！：）

^{pr2}$