Leetcode刷题--二叉搜索树节点的最小距离

在Leetcode上刷了这么一道题，我感觉思想挺好的，分享一下：

思路：首先通过深度优先搜索把每个不为null的节点val加到一个集合中，然后遍历集合，找差值的最小值。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    private int min = Integer.MAX_VALUE;

    public int minDiffInBST(TreeNode root) {
        List<Integer> valueList = new ArrayList<Integer>();
        dfs(root,valueList);
        for(int i = 0;i < valueList.size();i++){
            for(int j = i + 1;j < valueList.size();j++){
                min = Math.min(min,Math.abs(valueList.get(i)-valueList.get(j)));
            }
        }
        return min;
    }

    public void dfs(TreeNode node,List<Integer> list){
        if(node != null){
            int a = node.val;
            list.add(a);
            dfs(node.left,list);
            dfs(node.right,list);
        }
    }

}

但是很明显：双重for循环大大增加了时间复杂度！

 

那么，我们应该思考一下如何去优化：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    private int min = Integer.MAX_VALUE;

    public int minDiffInBST(TreeNode root) {
        List<Integer> valueList = new ArrayList<Integer>();
        dfs(root,valueList);
        /*for(int i = 0;i < valueList.size();i++){
            for(int j = i + 1;j < valueList.size();j++){
                min = Math.min(min,Math.abs(valueList.get(i)-valueList.get(j)));
            }
        }*/
        Collections.sort(valueList);
        for(int i = 0; i < valueList.size() - 1;i++){
            min = Math.min(min,valueList.get(i+1)-valueList.get(i));
        }
        return min;
    }

    public void dfs(TreeNode node,List<Integer> list){
        if(node != null){
            int a = node.val;
            list.add(a);
            dfs(node.left,list);
            dfs(node.right,list);
        }
    }

}

我们再来看看效果：