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. More formally, the property root.val = min(root.left.val, root.right.val)
always holds.
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.
思路:这题就是要知道最小值,就是root.val,那么题目变成找到比root.val大一点点的value;
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int findSecondMinimumValue(TreeNode root) {
if(root == null) {
return -1;
}
int min = root.val;
int diff = Integer.MAX_VALUE;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
int res = -1;
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
if(node.val > min) {
if(node.val - min < diff) {
diff = node.val - min;
res = node.val;
}
}
if(node.left != null) {
queue.offer(node.left);
}
if(node.right != null) {
queue.offer(node.right);
}
}
return res;
}
}