-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
47 lines (44 loc) · 1.15 KB
/
Solution.cs
File metadata and controls
47 lines (44 loc) · 1.15 KB
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
43
44
45
46
47
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution
{
public int GetMinimumDifference(TreeNode root)
{
if (root == null) return int.MaxValue;
int min = GetMin(root.right);
int max = GetMax(root.left);
int diff = Math.Min(min - root.val, root.val - max);
diff = Math.Min(diff, GetMinimumDifference(root.left));
diff = Math.Min(diff, GetMinimumDifference(root.right));
return diff;
}
public int GetMin(TreeNode root)
{
if (root == null) return int.MaxValue / 2;
while (root.left != null)
{
root = root.left;
}
return root.val;
}
private int GetMax(TreeNode root)
{
if (root == null) return int.MinValue / 2;
while (root.right != null)
{
root = root.right;
}
return root.val;
}
}