Day10

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

@@ -7,6 +7,6 @@ internal class Program
         TreeNode root = new TreeNode(6);
         root.left = new TreeNode(2) { left = new TreeNode(0), right = new TreeNode(4) { left = new TreeNode(3), right = new TreeNode(5) } };
         root.right = new TreeNode(8) { left = new TreeNode(7), right = new TreeNode(9) };
-        Console.WriteLine(new Solution().LowestCommonAncestor(root, new TreeNode(3), new TreeNode(5)).val);
+        Console.WriteLine(new Solution().LowestCommonAncestor(root, new TreeNode(3), new TreeNode(5))?.val);
     }
 }

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

@@ -6,11 +6,11 @@ public class Solution
     {
         int min = Math.Min(p.val, q.val);
         int max = Math.Max(p.val, q.val);
-        while(true)
+        while (true)
         {
             if (root == null)
                 return null;
-            else if (min <= root.val && max>=root.val)
+            else if (min <= root.val && max >= root.val)
                 return root;
             else if (root.val >= p.val)
                 root = root.left!;

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

@@ -1,7 +1,8 @@
 namespace _235._Lowest_Common_Ancestor_of_a_Binary_Search_Tree;
 
 //Definition for a binary tree node.
-public class TreeNode {
+public class TreeNode
+{
     public int val;
     public TreeNode? left;
     public TreeNode? right;