Update 0530.二叉搜索树的最小绝对差.md

This commit is contained in:
nmydt
2021-06-07 16:44:12 +08:00
committed by GitHub
parent 0a2a5b180a
commit 2499b611a5

View File

@ -151,7 +151,30 @@ public:
Java Java
递归
```java
class Solution {
TreeNode pre;// 记录上一个遍历的结点
int result = Integer.MAX_VALUE;
public int getMinimumDifference(TreeNode root) {
if(root==null)return 0;
traversal(root);
return result;
}
public void traversal(TreeNode root){
if(root==null)return;
//左
traversal(root.left);
//中
if(pre!=null){
result = Math.min(result,root.val-pre.val);
}
pre = root;
//右
traversal(root.right);
}
}
```
```Java ```Java
class Solution { class Solution {
TreeNode pre;// 记录上一个遍历的结点 TreeNode pre;// 记录上一个遍历的结点