暂存吧,不是很难的题,但是一直想不出思路
/**
* 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 {
int ans = -1;
public int findSecondMinimumValue(TreeNode root) {
dfs(root,root.val);
return ans;
}
void dfs(TreeNode root,int min){
if(root==null) return ;
if(root.val!=min){
if(ans==-1) ans = root.val;
else ans = Math.min(root.val,ans);
return ;
}
dfs(root.left,min);
dfs(root.right,min);
}
}