Leetcode 865. Smallest Subtree with all the Deepest Nodes

这道题的关键在于知道每个节点的深度，可以用哈希表保存的前提下，怎么找出公共最小的父节点。方法是，如果当前node左右节点都有深度最大节点，返回当前node，如果只有左边有，返回node的左节点，反之返回右节点。也就是以下的java代码
public TreeNode answer(TreeNode node) {
if (node == null || depth.get(node) == max_depth)
return node;
TreeNode L = answer(node.left),
R = answer(node.right);
if (L != null && R != null) return node;
if (L != null) return L;
if (R != null) return R;
return null;
}
自写Ｃ＋＋代码
···
class Solution {
public:
unordered_map<int, int> depth_map;
int depth = -1;
TreeNode* subtreeWithAllDeepest(TreeNode* root) {
dfs(root, depth);
for (auto ipair : depth_map)
depth = max(depth, ipair.second);
return getanswer(root, depth);
}
void dfs(TreeNode node, int depth) {
// if(node -> left == nullptr && node -> right == nullptr)
if (!node)
return;
depth_map.insert({node -> val, depth + 1});
if (node -> left)
dfs(node -> left, depth + 1);
if (node -> right)
dfs(node -> right, depth + 1);
}
TreeNode getanswer(TreeNode node, int depth) {
if (node == nullptr || depth_map[node -> val] == depth)
return node;
TreeNode l = getanswer(node -> left, depth), *r = getanswer(node -> right, depth);
if (l && r)
return node;
else if(!l)
return r;
else if (!r)
return l;
else
return nullptr;
}
};
···

转载于:https://www.cnblogs.com/bloomingFlower/p/9314903.html