Time: 0 ms (100%), Space: 22.1 MB (67.37%) - LeetHub

karygauss03 · karygauss03 · commit 15082c3ee1f9 · 2025-04-04T10:32:25.000+01:00
diff --git a/1218-lowest-common-ancestor-of-deepest-leaves/1218-lowest-common-ancestor-of-deepest-leaves.cpp b/1218-lowest-common-ancestor-of-deepest-leaves/1218-lowest-common-ancestor-of-deepest-leaves.cpp
@@ -0,0 +1,27 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+private:
+    pair<TreeNode*, int> dfs(TreeNode* node) {
+        if (node == nullptr) return {nullptr, 0};
+        pair<TreeNode*, int> l = dfs(node->left);
+        pair<TreeNode*, int> r = dfs(node->right);
+
+        if (l.second > r.second) return {l.first, l.second + 1};
+        if (l.second < r.second) return {r.first, r.second + 1};
+        return {node, l.second + 1};
+    }
+public:
+    TreeNode* lcaDeepestLeaves(TreeNode* root) {
+        return dfs(root).first;
+    }
+};
