解题思路:
(1)使用判别先序遍历+multiset
/**
* 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) {
multiset<int> s;
inorder(s,root);
int target = *s.begin();
for(auto it=next(s.begin());it!=s.end();it++) {
if(target!=*it) {
target = *it;
break;
}
}
return (target==*s.begin())?-1:target;
}
void inorder(multiset<int> &s,TreeNode *root) {
if(root==NULL) return;
s.insert(root->val);
if(root->left!=NULL) {
if(root->left->val==root->val) { // 中左右
inorder(s,root->left);
inorder(s,root->right);
} else { // 中右左
inorder(s,root->right);
inorder(s,root->left);
}
}
}
};