-
Notifications
You must be signed in to change notification settings - Fork 2
/
1123.cpp
25 lines (25 loc) · 930 Bytes
/
1123.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
/**
* 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 {
public:
pair<int, TreeNode*> dfs(TreeNode* node) {
if (node == nullptr) return make_pair(0, nullptr);
pair<int, TreeNode*> left = dfs(node->left);
pair<int, TreeNode*> right = dfs(node->right);
int maxDepth = max(left.first, right.first) + 1;
TreeNode* commonAncestor = (left.first == right.first) ? node : (left.first > right.first) ? left.second : right.second;
return make_pair(maxDepth, commonAncestor);
}
TreeNode* lcaDeepestLeaves(TreeNode* root) {
return dfs(root).second;
}
};