save project

diy2.py

@@ -8,14 +8,27 @@
 #             alist[j] , alist[j+1] = alist[j+1] , alist[j]
 #     print(alist)
 import turtle as t
+def tree(n):
+    if n>=50:
+        t.forward(n)
+        t.right(30)
+        tree(n-10)
+        t.left(60)
+        tree(n-10)
+        t.right(30)
+        t.up()
+        t.backward(n)
+        t.down()
 t.goto(0,0)
 t.left(90)
-t.forward(100)
-t.left(30)
-t.forward(50)
-t.up()
-t.goto(0,100)
-t.down()
-t.right(60)
-t.forward(50)
-t.done()
\ No newline at end of file
+tree(100)
+# t.forward(100)
+# t.left(30)
+# t.forward(50)
+# t.up()
+# t.goto(0,100)
+# t.down()
+# t.right(60)
+# t.forward(50)
+t.done()
+ 
\ No newline at end of file