feat: update solutions to leetcode problem: No.0236

Author: yanglbme

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/README.md

@@ -110,19 +110,12 @@ class Solution:
 
 class Solution {
     public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-        if (p == q) {
-            return p;
-        }
         while (root != null) {
-            if (root.val < p.val && root.val < q.val) {
-                root = root.right;
-            } else if (root.val > p.val && root.val > q.val) {
-                root = root.left;
-            } else {
-                return root;
-            }
+            if (root.val < p.val && root.val < q.val) root = root.right;
+            else if (root.val > p.val && root.val > q.val) root = root.left;
+            else return root;
         }
-        return null;
+        return root;
     }
 }
 ```

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/README_EN.md

@@ -63,8 +63,8 @@ Iterative:
 
 class Solution:
     def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
-        if p == q:
-            return p
+        if root is None:
+            return None
         while root:
             if root.val < p.val and root.val < q.val:
                 root = root.right
@@ -112,19 +112,12 @@ Iterative:
 
 class Solution {
     public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-        if (p == q) {
-            return p;
-        }
         while (root != null) {
-            if (root.val < p.val && root.val < q.val) {
-                root = root.right;
-            } else if (root.val > p.val && root.val > q.val) {
-                root = root.left;
-            } else {
-                return root;
-            }
+            if (root.val < p.val && root.val < q.val) root = root.right;
+            else if (root.val > p.val && root.val > q.val) root = root.left;
+            else return root;
         }
-        return null;
+        return root;
     }
 }
 ```

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/Solution.java

@@ -10,18 +10,11 @@
 
 class Solution {
     public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-        if (p == q) {
-            return p;
-        }
         while (root != null) {
-            if (root.val < p.val && root.val < q.val) {
-                root = root.right;
-            } else if (root.val > p.val && root.val > q.val) {
-                root = root.left;
-            } else {
-                return root;
-            }
+            if (root.val < p.val && root.val < q.val) root = root.right;
+            else if (root.val > p.val && root.val > q.val) root = root.left;
+            else return root;
         }
-        return null;
+        return root;
     }
 }

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/Solution.py

@@ -7,8 +7,8 @@
 
 class Solution:
     def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
-        if p == q:
-            return p
+        if root is None:
+            return None
         while root:
             if root.val < p.val and root.val < q.val:
                 root = root.right