671. Second Minimum Node In a Binary Tree（python+cpp）

题目：

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 anysecond smallest value.

解释：
第一反应就是用两个变量分别记录最小值的次小值，在遍历的过程中更新这两个值，初始化为-1。无需先遍历出结果再求最小值啊。
python代码：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def findSecondMinimumValue(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.min=float('inf')
        self.second_min=float('inf')
        def dfs(root):
            if  root.val<self.min:
                self.second_min=self.min
                self.min=root.val
            elif root.val<self.second_min and root.val!=self.min:
                self.second_min=root.val
            if root.left:
                dfs(root.left)
            if root.right:
                dfs(root.right)
        if root:
            dfs(root)
        return self.second_min if  self.second_min!=float('inf') else -1

c++代码：

/**
 * 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:
    int first_min=INT_MAX;
    int second_min=INT_MAX;
    int findSecondMinimumValue(TreeNode* root) {
        if(root)
            dfs(root);
        return second_min!=INT_MAX?second_min:-1;
    }
    void dfs(TreeNode* root)
    {
        if (root->val<first_min)
        {
            second_min=first_min;
            first_min=root->val;
        }
        else if(root->val<second_min &&root->val!=first_min)
            second_min=root->val;
        if (root->left)
            dfs(root->left);
        if(root->right)
            dfs(root->right);
    }
};

总结：
还是那句话，遇到树的问题，尽量在遍历的过程中更新变量，不需要先遍历完成再求最后的结果。