auto save

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+import turtle
+a=turtle.Pen()
\ No newline at end of file
+
+a.left(90)
+a.penup()
+a.fd(-200)
+a.pendown()
+a.speed(0)
+def rtree(n):
+    if n>=30:
+        a.fd(n)
+        a.right(30)
+        tree(n-15)
+        a.left(60)
+        tree(n-15)
+        a.right(30)
+        a.penup()
+        a.fd(-n)
+        a.pendown()
+a.right(20)
+rtree(100)
+
+
+turtle.done()
\ No newline at end of file