1123. Lowest Common Ancestor of Deepest Leaves

Author: ioesandeep

leetcode/medium/LCADeepestLeaves.java

@@ -0,0 +1,31 @@
+package leetcode.medium;
+
+import leetcode.easy.TreeNode;
+
+public class LCADeepestLeaves {
+    public TreeNode lcaDeepestLeaves(TreeNode root) {
+        int heightLeft = height(root.left);
+        int heightRight = height(root.right);
+
+        if (heightLeft < heightRight) {
+            return lcaDeepestLeaves(root.right);
+        }
+
+        if (heightLeft > heightRight) {
+            return lcaDeepestLeaves(root.left);
+        }
+
+        return root;
+    }
+
+    public int height(TreeNode root) {
+        if (root == null) {
+            return 0;
+        }
+
+        int heightLeft = height(root.left);
+        int heightRight = height(root.right);
+
+        return 1 + Math.max(heightLeft, heightRight);
+    }
+}

readme.md

@@ -160,7 +160,7 @@ EASY
 |[1100. Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/medium/KLengthSubstringNoRepeatedCharacters.java)|
 |[1108. Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/easy/DefangIPAddress.java)|
 |[1119. Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/easy/RemoveVowelsFromString.java)|
-|[]()|[java]()|
+|[1123. Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/easy/LCADeepestLeaves.java)|
 |[]()|[java]()|
 |[]()|[java]()|
 |[]()|[java]()|