[leetcode]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.

 

题意：

求二叉树次小结点

 

Solution1：DFS

 

code

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    int second = Integer.MAX_VALUE;
    
    public int findSecondMinimumValue(TreeNode root) {
        if(root==null)  return -1;
        helper(root, root.val);
        return second == Integer.MAX_VALUE ? -1 : second;
    }

    public void helper(TreeNode node, int rootVal){
        if(node == null){return;}
        
        if(node.val > rootVal && second > node.val){
            second = node.val;
        }
        
        helper(node.left, rootVal);
        helper(node.right, rootVal);
    }
}