From 2839bd0fc92ad1c23714d313e8178c2d6fd8b95d Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Sun, 16 May 2021 15:55:52 +0200
Subject: [PATCH] =?UTF-8?q?Update=200513.=E6=89=BE=E6=A0=91=E5=B7=A6?=
 =?UTF-8?q?=E4=B8=8B=E8=A7=92=E7=9A=84=E5=80=BC.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0513.找树左下角的值.md | 26 +++++++++++++++++++++++---
 1 file changed, 23 insertions(+), 3 deletions(-)

diff --git a/problems/0513.找树左下角的值.md b/problems/0513.找树左下角的值.md
index ac21dc68..44096a29 100644
--- a/problems/0513.找树左下角的值.md
+++ b/problems/0513.找树左下角的值.md
@@ -274,8 +274,28 @@ class Solution {
 
 
 Python：
-
-
+```python
+//递归法
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def findBottomLeftValue(self, root: TreeNode) -> int:
+        depth=0
+        self.res=[]
+        def level(root,depth):
+            if not root:return
+            if depth==len(self.res):
+                self.res.append([])
+                self.res[depth].append(root.val)
+            level(root.left,depth+1)
+            level(root.right,depth+1)
+        level(root,depth)
+        return self.res[-1][0]
+```
 Go：
 
 
@@ -285,4 +305,4 @@ Go：
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
 * B站视频：[代码随想录](https://space.bilibili.com/525438321)
 * 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>
\ No newline at end of file
+<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>