给你一个二叉搜索树的根节点 root
,返回 树中任意两不同节点值之间的最小差值 。
差值是一个正数,其数值等于两值之差的绝对值。
示例 1:
输入:root = [4,2,6,1,3] 输出:1
示例 2:
输入:root = [1,0,48,null,null,12,49] 输出:1
提示:
- 树中节点的数目范围是
[2, 104]
0 <= Node.val <= 105
暴力:
/**
* 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 {
private int num=0;
private int[] arr=new int[10000];
public int getMinimumDifference(TreeNode root) {
inorder(root);
int[] newarr=Arrays.copyOf(arr,num);
Arrays.sort(newarr);
int[] aaa=new int[newarr.length-1];
for(int i=1;i<newarr.length;i++){
aaa[i-1]=Math.abs(newarr[i]-newarr[i-1]);
}
for(int i=0;i<newarr.length;i++){
System.out.println(newarr[i]);
}
Arrays.sort(aaa);
return aaa[0];
}
public void inorder(TreeNode node){
if(node!=null){
arr[num]=node.val;
num++;
inorder(node.left);
inorder(node.right);
}
}
}
递归实现:
/**
* 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 pre;//前驱
int ans;//最小
public int getMinimumDifference(TreeNode root) {
ans=Integer.MAX_VALUE;
pre=-1;
dfs(root);
return ans;
}
public void dfs(TreeNode node){
if(node==null){
return;
}
dfs(node.left);
if(pre==-1){
pre=node.val;
}else{
ans=Math.min(ans,node.val-pre);
pre=node.val;
}
dfs(node.right);
}
}