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. More formally, the property root.val = min(root.left.val, root.right.val) always holds.

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: root = [2,2,5,null,null,5,7]
Output: 5
Explanation: The smallest value is 2, the second smallest value is 5.

Example 2:

Input: root = [2,2,2]
Output: -1
Explanation: The smallest value is 2, but there isn't any second smallest value.

Constraints:

• The number of nodes in the tree is in the range [1, 25].
• 1 <= Node.val <= 231 - 1
• root.val == min(root.left.val, root.right.val) for each internal node of the tree.

思路：

首先parent的value是child的最小值，那么root一定是全树最小的。遍历整棵树，找到比root的value大并且严格只比它大的最小数就是第二大的树。DFS或者BFS都可以，代码1是DFS，代码2是BFS。

代码1：

/**

 * 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) {

        benchmark = root->val;

        dfs(root);

        return ans;

    }

private:

    int ans = -1;

    int benchmark;

    void dfs(TreeNode* root) {

        if (!root)

            return;

        if (root->val > benchmark && root->val != benchmark) {

            if(ans == -1)

                ans = root->val;

            else

                ans = root->val < ans ? root->val : ans;

        }

        dfs(root->left);

        dfs(root->right);

    }

};

代码2：

/**
 * 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) {}
 * };
 */
/**
 * 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) {
        if (!root)
            return -1;
        int ans = -1, benchmark = root->val;
        queue<TreeNode* > q;
        q.push(root);
        while(q.size()) {
            int len = q.size();
            for(int i = 0; i < len; i++) {
                auto tmp = q.front();
                q.pop();
                if ( tmp->val > benchmark) {
                    if ( ans == -1 )
                        ans = tmp->val;
                    else 
                        ans = ans > tmp->val ? tmp->val : ans;
                }
                if (tmp->left) {
                    q.push(tmp->left);
                    q.push(tmp->right);
                }
            }
        }
        return ans;
    }
};