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.
题目含义：一棵非空的二叉树，每一个节点的值是它的两个子节点中较小的那个值。求该二叉树中第二小的数。如果不存在则输出-1 

    private Set<Integer> treeSet = new TreeSet<>();
    private void parserTreeNode(TreeNode root)
    {
        if (root == null)return;
        treeSet.add(root.val);
        parserTreeNode(root.left);
        parserTreeNode(root.right);
    }    
    
    public int findSecondMinimumValue(TreeNode root) {
        parserTreeNode(root);
        Iterator<Integer> iterator = treeSet.iterator();
        int i=0;
        while (iterator.hasNext())
        {
            i++;
            int result = iterator.next();
            if (i==2) return result;
        }
        return -1;        
    }