1746. 二叉搜索树结点最小距离

1746. 二叉搜索树结点最小距离

 

给定一个二叉搜索树的根结点 root, 返回树中任意两节点的差的最小值。

样例

Example 1:

Input: root = {2,1}

Output: 1

Explanation:

Note that root is a TreeNode object, not an array.

 

The given tree {2,1} is represented by the following diagram:

 

2

/

1

 

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

Example 2:

Input: root = {4,2,6,1,3}

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.

注意事项

• 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.

 

 

/**

* Definition of TreeNode:

* public class TreeNode {

*     public int val;

*     public TreeNode left, right;

*     public TreeNode(int val) {

*         this.val = val;

*         this.left = this.right = null;

*     }

* }

*/

 

 

public class Solution {

    int ret = Integer.MAX_VALUE;

    int last = -1000;

    public int minDiffInBST(TreeNode root) {

         if (root == null) return 0;

                minDiffInBST(root.left);

                ret = Math.min(ret, root.val - last);

                last = root.val;

                minDiffInBST(root.right);

                return ret;

    }

}