From 5155c815ed5bfdc1004d50da41cfcc2f66837567 Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Thu, 20 May 2021 00:06:55 +0200
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200236.=20=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=E7=9A=84=E6=9C=80=E8=BF=91=E5=85=AC=E5=85=B1=E7=A5=96?=
 =?UTF-8?q?=E5=85=88=20python=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

added python version of code
---
 .../0236.二叉树的最近公共祖先.md    | 20 +++++++++++++++++--
 1 file changed, 18 insertions(+), 2 deletions(-)

diff --git a/problems/0236.二叉树的最近公共祖先.md b/problems/0236.二叉树的最近公共祖先.md
index 3233c6a1..a32c017e 100644
--- a/problems/0236.二叉树的最近公共祖先.md
+++ b/problems/0236.二叉树的最近公共祖先.md
@@ -263,8 +263,24 @@ class Solution {
 ```
 
 Python：
-
-
+```python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+//递归
+class Solution:
+    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+        if not root or root == p or root == q: return root  //找到了节点p或者q，或者遇到空节点
+        left = self.lowestCommonAncestor(root.left,p,q)  //左
+        right = self.lowestCommonAncestor(root.right,p,q)  //右
+        if left and right: return root  //中: left和right不为空，root就是最近公共节点
+        elif left and not right: return left  //目标节点是通过left返回的
+        elif not left and right: return right  //目标节点是通过right返回的
+        else: return None  //没找到
+```
 Go：
 ```Go
 func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {