递归::
/**
* 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 {
TreeNode pre;
int result=Integer.MAX_VALUE;
public int getMinimumDifference(TreeNode root) {
traversal(root);
return result;
}
public void traversal(TreeNode node){
if(node==null) return;
traversal(node.left);
if(pre!=null) result=Math.min(result,node.val-pre.val);
pre=node;
traversal(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 {
public int getMinimumDifference(TreeNode root) {
Stack<TreeNode> stack=new Stack<>();
TreeNode cur=root;
TreeNode pre=null;
int result=Integer.MAX_VALUE;
while(cur!=null||!stack.isEmpty()){
if(cur!=null){
stack.push(cur);
cur=cur.left;
}else{
cur=stack.pop();
if(pre!=null) result=Math.min(result,cur.val-pre.val);
pre=cur;
cur=cur.right;
}
}
return result;
}
}