脚本宝典收集整理的这篇文章主要介绍了[LeetCode] 671. Second Minimum Node In a Binary Tree，脚本宝典觉得挺不错的，现在分享给大家，也给大家做个参考。
Problem
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
class Solution {
public int findSecondMinimumValue(TreeNode root) {
if(root == null || root.left == null) return -1;
int leftRes, rightRes;
if (root.left.val == root.val) {
leftRes = findSecondMinimumValue(root.left);
} else {
leftRes = root.left.val;
}
if (root.right.val == root.val) {
rightRes = findSecondMinimumValue(root.right);
} else {
rightRes = root.right.val;
}
if (leftRes == -1 && rightRes == -1) return -1;
else if (leftRes == -1) return rightRes;
else if (rightRes == -1) return leftRes;
else return Math.min(leftRes, rightRes);
}
}以上是脚本宝典为你收集整理的[LeetCode] 671. Second Minimum Node In a Binary Tree全部内容，希望文章能够帮你解决[LeetCode] 671. Second Minimum Node In a Binary Tree所遇到的问题。
本图文内容来源于网友网络收集整理提供，作为学习参考使用，版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ：384754419，请注明来意。