思路:
(1)先序遍历二叉树,得到的遍历结果存入List;
(2)对List进行排序,遍历List,依次判断每相邻两个值的差是否小于最小值result,是则更新result。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
List<Integer> nodes = new ArrayList<Integer>();
public int getMinimumDifference(TreeNode root) {
triversal(root);
Collections.sort(nodes);
int result = Integer.MAX_VALUE;
for (int i = 1; i < nodes.size(); i++) {
if (nodes.get(i) - nodes.get(i - 1) < result)
result = nodes.get(i) - nodes.get(i - 1);
}
return result;
}
public void triversal(TreeNode root) {
if (root != null) {
nodes.add(root.val);
triversal(root.left);
triversal(root.right);
}
}
}
Runtime:26ms