LeetCode-671. Second Minimum Node In a Binary Tree

Description

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.

Solution 1(C++)

class Solution {
private:
    int min1=INT_MAX, min2=INT_MAX;
public:
    void travel(TreeNode* node){
        if(!node) return;
        if(node->val < min1) {min2=min1; min1=node->val;}
        if(node->val < min2 && node->val != min1) min2=node->val;
        travel(node->left);
        travel(node->right);
    }
    int findSecondMinimumValue(TreeNode* root) {
        travel(root);
        return min2==INT_MAX? -1: min2;
    }
};

Solution 2(C++)

class Solution {
public:
    int findSecondMinimumValue(TreeNode* root) {
        if (!root) return -1;
        int ans = minval(root, root->val);
        return ans;
    }
private:
    int minval(TreeNode* p, int first) {
        if (p == nullptr) return -1;
        if (p->val != first) return p->val;
        int left = minval(p->left, first), right = minval(p->right, first);
        if (left == -1) return right;
        if (right == -1) return left;
        return min(left, right);
    }
};

算法分析

解法一是自己做的，有点笨，还是遍历，然后找到第二小的。所以我推荐解法二。因为根节点是两个子节点中较小的一个，所以每次，只要返回根节点与两个子节点中最大的那个，就是第二小，然后如此遍历所有树节点，即可。

程序分析

要掌握树的遍历方法。