Create: 235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cs

Author: Ykhan799

csharp/235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cs

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     public int val;
+ *     public TreeNode left;
+ *     public TreeNode right;
+ *     public TreeNode(int x) { val = x; }
+ * }
+ */
+
+public class Solution {
+    public TreeNode LowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+        // Traverse Right child
+        if (p.val > root.val && q.val > root.val) {
+            return LowestCommonAncestor(root.right, p, q);
+        }
+        
+        // Traverse Left Child
+        if (p.val < root.val && q.val < root.val) {
+            return LowestCommonAncestor(root.left, p, q);
+        }
+        
+        return root;
+    }
+}