-
Notifications
You must be signed in to change notification settings - Fork 41
/
solution.java
42 lines (36 loc) · 869 Bytes
/
solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
* 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 last = Integer.MAX_VALUE;
private int result = Integer.MAX_VALUE;
public int getMinimumDifference(TreeNode root) {
last = root.val;
inOrder(root);
return result;
}
private void inOrder(TreeNode node) {
if (node.left != null) {
inOrder(node.left);
}
if (last < node.val) {
result = Math.min(result, node.val - last);
}
last = node.val;
if (node.right != null) {
inOrder(node.right);
}
}
}