Leetcode——671. Second Minimum Node In a Binary Tree

题目原址

https://leetcode.com/problems/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.

解题思路

给定一个二叉树，求二叉树中第二小的节点的值，这里面给出每个节点的值等于其左右子树中最小的节点的值。
解这个题，就是要遍历出整个二叉树，那这里面通过什么样的方式遍历都可以了，所以我选择使用按层遍历。因为根节点一定是最小的值，所以首先记录根节点的值。然后每次按曾遍历都找到树的最小的值，但是这个值不能等于根节点的值。

AC代码

class Solution {
    public int findSecondMinimumValue(TreeNode root) {
         int min = -1;
        if(root == null)
            return -1;
        min = root.val;
        Queue<TreeNode> queue = new LinkedList<>(); 
        queue.add(root);
        int minS = Integer.MAX_VALUE;
        while(queue.size() > 0) {
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                TreeNode tn = queue.poll();
                if(minS > tn.val && tn.val != min)
                    minS = tn.val;
                if(tn.left != null) 
                    queue.add(tn.left);
                if(tn.right != null) 
                    queue.add(tn.right);
            }
        }
        if(minS > min && minS != Integer.MAX_VALUE)
            min = minS;
        return min == root.val ? -1 : min;       
    }
}