| 9 | |
| 10 | |
| 11 | def tree(i): |
| 12 | if i < 10: |
| 13 | return |
| 14 | else: |
| 15 | t.right(15) |
| 16 | t.forward(15) |
| 17 | t.left(20) |
| 18 | t.backward(20) |
| 19 | tree(2 * i / 5) |
| 20 | t.left(2) |
| 21 | tree(3 * i / 4) |
| 22 | t.left(2) |
| 23 | tree(i / 2) |
| 24 | t.backward(num / 5) |
| 25 | tree(random.randint(1, 100)) |
| 26 | tree(random.randint(1, num)) |
| 27 | tree(random.randint(1, num / 2)) |
| 28 | tree(random.randint(1, num / 3)) |
| 29 | tree(random.randint(1, num / 2)) |
| 30 | tree(random.randint(1, num)) |
| 31 | tree(random.randint(1, 100)) |
| 32 | t.forward(num / 5) |
| 33 | t.right(2) |
| 34 | tree(3 * i / 4) |
| 35 | t.right(2) |
| 36 | tree(2 * i / 5) |
| 37 | t.right(2) |
| 38 | t.left(10) |
| 39 | t.backward(10) |
| 40 | t.right(15) |
| 41 | t.forward(15) |
| 42 | print("tree execution complete") |
| 43 | |
| 44 | |
| 45 | def cycle(i): |