编程训练第八十九期——二叉搜索树的最小绝对差

编程问题：

给你一棵所有节点为非负值的二叉搜索树，请你计算树中任意两节点的差的绝对值的最小值。

---

示例：

• 输入：[1,null,3,2]
  输出：1

---

解法：

1.递归
时间复杂度O(N)
空间复杂度O(N)

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> res;
    void dfs(TreeNode *root)
    {
        if (root)
        {
            dfs(root->left);
            res.push_back(root->val);
            dfs(root->right);
        }
    }

    int getMinimumDifference(TreeNode* root) {
        dfs(root);
        int min = INT_MAX;
        for (int i = 1; i < res.size(); i++)
        {
            if (res[i] - res[i-1] < min)
                min = res[i] - res[i-1];
        }
        return min;
    }
};

或不使用额外空间存放树中结点的值

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void dfs(TreeNode *root, int& res, int& pre)
    {
        if (root)
        {
            dfs(root->left, res, pre);
            if (pre == -1)
                pre = root->val;
            else
            {
                res = min(res, root->val - pre);
                pre = root->val;
            }
            dfs(root->right, res, pre);
        }
    }

    int getMinimumDifference(TreeNode* root) {
        int res = INT_MAX;
        int pre = -1;
        dfs(root, res, pre);
        return res;
    }
};