LeetCode 671. Second Minimum Node In a Binary Tree

Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node’s value is the smaller value among its two sub-nodes.

Given such a binary tree, you need to output the second minimum value in the set made of all the nodes’ value in the whole tree.

If no such second minimum value exists, output -1 instead.

Example 1:
Input:

    2
   / \
  2   5
     / \
    5   7

Output: 5
Explanation: The smallest value is 2, the second smallest value is 5.
Example 2:
Input:

    2
   / \
  2   2

Output: -1
Explanation: The smallest value is 2, but there isn’t any second smallest value.

思路： 遍历二叉树，可以用set容器； 也可以两次遍历来求Second Minimum Node; 但是题目中说的一个节点要么有两个子节点，要么为叶子节点 这个条件 好像没有用到啊。。。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    set<int> m_set;
    void fill_m_set(TreeNode* root)
    {
        if(!root)
            return;
        m_set.insert(root->val);
        fill_m_set(root->left);
        fill_m_set(root->right);
    }
    int findSecondMinimumValue(TreeNode* root) {
        fill_m_set(root);
        if(m_set.size() < 2)
            return -1;
        auto it = m_set.begin();
        ++it;
        return *it;

    }
};