783. Minimum Distance Between BST Nodes

783. Minimum Distance Between BST Nodes

---

题目

Leetcode题目

Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.

Example :

Input: root = [4,2,6,1,3,null,null]
Output: 1
Explanation:
Note that root is a TreeNode object, not an array.

The given tree [4,2,6,1,3,null,null] is represented by the following diagram:

          4
        /   \
      2      6
     / \    
    1   3  

while the minimum difference in this tree is 1, it occurs between node 1 and node 2, also between node 3 and node 2.

Note:

• The size of the BST will be between 2 and 100.
• The BST is always valid, each node’s value is an integer, and each node’s value is different.

---

解决

将二叉树所有节点上的值存进数组中，并且进行排序。之后两两做差，得到最小差。
假设树一共有n个节点。

• 时间复杂度：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:
    int minDiffInBST(TreeNode* root) {
        vector<int> values;
        queue<TreeNode*> tree;
        tree.push(root);
        while (!tree.empty()) {
            TreeNode* temp = tree.front();
            values.push_back(temp->val);
            tree.pop();
            if (temp->left) tree.push(temp->left);
            if (temp->right) tree.push(temp->right);
        }
        sort(values.begin(), values.end());
        int n = values.size();
        int result = 100;
        for (int i = 1; i < n; i++) {
            if (values[i] - values[i - 1] < result) {
                result = values[i] - values[i - 1];
            }
        }
        return result;
    }
};