/**
* 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:
int findSecondMinimumValue(TreeNode* root) {
int ans=-1;
int rootvalue=root->val;
function<void(TreeNode*)>dfs =[&](TreeNode*node)
{
if(!node)
{
return;
}
//return 代表跳过此次循环,若node->val<ans则进入下一个函数,更新ans
if(ans!=-1&&node->val>=ans)
{
return;
}
if(node->val>rootvalue)
{
ans=node->val;
}
dfs(node->left);
dfs(node->right);
};
dfs(root);
return ans;
}
};
08-03
09-24
76
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-11
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交