#Fractal: Arbol de Pitagoras

#Colocar un tamaño de arriba de 80 para apreciar correctamente.
# El nivel de recursividad que se desee, 
#pero entre más profundo, más tardado.

def leaves (l,rec):
    if rec<=0:

        turtle.forward(l)
    else:
        turtle.right(135)
        turtle.forward(l*0.7071067)
        turtle.left(90)
        leaves(l*0.7071067,rec-1)
        turtle.left(90)
        turtle.forward(l*0.7071067)
        turtle.left(90)
        turtle.forward(l*0.7071067)
        turtle.right(135)

        turtle.forward(l)

        turtle.right(135)
        turtle.forward(l*0.7071067)
        turtle.left(90)
        turtle.forward(l * 0.7071067)
        turtle.left(90)
        leaves(l*0.7071067,rec-1)
        turtle.left(90)
        turtle.forward(l * 0.7071067)
        turtle.right(135)

def draw_tree (l,rec):
    turtle.forward(l)
    turtle.left(90)
    turtle.forward(l)
    turtle.left(90)
    turtle.fillcolor("green")
    turtle.begin_fill()
    leaves(l,rec)
    turtle.end_fill()
    turtle.fillcolor("brown")
    turtle.begin_fill()
    for i in range (0,4):
        turtle.left(90)
        turtle.forward(l)
    turtle.end_fill()

#Main
import turtle

size = int (input("Seleccione tamano: "))
n= int (input("Seleccione nivel de recursividad: "))
screen = turtle.Screen()
turtle = turtle.Turtle()
#screen.title("Arbol de pitagoras")
screen.setup(660,680,680,0)
turtle.hideturtle()
turtle.speed(200)
turtle.color("brown")
turtle.penup()
turtle.goto(-(size/2),-size-100)
turtle.pendown()

draw_tree (size,n)