Files

42 lines
606 B
Python

import turtle
t = turtle.Turtle()
t.left(90)
# def hexagon(n):
# for i in range(n):
# turtle.right(120)
# turtle.forward(200)
# hexagon(6)
# def stair(n):
# if n <= 0:
# return
# t.forward(20)
# t.left(90)
# t.forward(20)
# t.right(90)
# stair(n - 1)
# t.speed(10)
# stair(100)
# turtle.done()
def baum(n):
if n < 0:
return
t.forward(n / 3)
t.left(30)
baum(n - 10)
t.right(60)
baum(n - 10)
t.left(30)
t.backward(n / 3)
turtle.tracer(False)
turtle.speed(0)
baum(150)
turtle.update()
turtle.done()