FastAuthCode
diff --git a/‎docs/.vuepress/dist‎
Lines changed: 1 addition & 1 deletion b/‎docs/.vuepress/dist‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎docs/data-structure-algorithms/soultion/Binary-Tree-Solution.md‎
Lines changed: 24 additions & 26 deletions b/‎docs/data-structure-algorithms/soultion/Binary-Tree-Solution.md‎
Lines changed: 24 additions & 26 deletions
@@ -1 +1 @@
-Subproject commit 73649b860108b81cbcc8f505c077d5d287e3190d
+Subproject commit e02f59de5d2afd19f5f9bde3a84cd808a20b3094
@@ -1574,32 +1574,30 @@ class Solution {
 
 
 ```java
-public class Solution {
-    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-        // 如果当前节点为空，则返回null
-        if (root == null) {
-            return null;
-        }
-        // 如果当前节点是p或q，则返回当前节点
-        if (root == p || root == q) {
-            return root;
-        }
-        // 递归地在左子树中查找p和q
-        TreeNode left = lowestCommonAncestor(root.left, p, q);
-        // 递归地在右子树中查找p和q
-        TreeNode right = lowestCommonAncestor(root.right, p, q);
-
-        // 根据left和right的值来判断最近公共祖先
-        if (left != null && right != null) {
-            // p和q分别位于左右子树中，当前节点是最近公共祖先
-            return root;
-        } else if (left != null) {
-            // p和q都在左子树中，返回左子树的结果
-            return left;
-        } else {
-            // p和q都在右子树中，返回右子树的结果
-            return right;
-        }
+public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+    // 如果当前节点为空，则返回null
+    if (root == null) {
+        return null;
+    }
+    // 如果当前节点是p或q，则返回当前节点
+    if (root == p || root == q) {
+        return root;
+    }
+    // 递归地在左子树中查找p和q
+    TreeNode left = lowestCommonAncestor(root.left, p, q);
+    // 递归地在右子树中查找p和q
+    TreeNode right = lowestCommonAncestor(root.right, p, q);
+
+    // 根据left和right的值来判断最近公共祖先
+    if (left != null && right != null) {
+        // p和q分别位于左右子树中，当前节点是最近公共祖先
+        return root;
+    } else if (left != null) {
+        // p和q都在左子树中，返回左子树的结果
+        return left;
+    } else {
+        // p和q都在右子树中，返回右子树的结果
+        return right;
     }
 }
 ```
Original file line number	Diff line number	Diff line change
`@@ -1 +1 @@`
`1`		`-Subproject commit 73649b860108b81cbcc8f505c077d5d287e3190d`
	`1`	`+Subproject commit e02f59de5d2afd19f5f9bde3a84cd808a20b3094`