1. 题目
2. 方法一
2.1. 代码
class Solution {
public:
int findSecondMinimumValue(TreeNode* root) {
if(root==NULL) return -1;
if(root->left==NULL&&root->right==NULL) return -1;
int leftval=root->left->val;
int rightval=root->right->val;
if(root->val==leftval) leftval=findSecondMinimumValue(root->left);
if(root->val==rightval) rightval=findSecondMinimumValue(root->right);
if(leftval!=-1&&rightval!=-1) return min(leftval,rightval);
if(leftval!=-1) return leftval;
return rightval;
}
};