## DEV Community

Abhishek Chaudhary

Posted on

# Minimum Distance Between BST Nodes

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

Example 1:

Input: root = [4,2,6,1,3]
Output: 1

Example 2:

Input: root = [1,0,48,null,null,12,49]
Output: 1

Constraints:

• The number of nodes in the tree is in the range `[2, 100]`.
• `0 <= Node.val <= 105`

Note: This question is the same as 530: https://leetcode.com/problems/minimum-absolute-difference-in-bst/

SOLUTION:

``````# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
def inorder(self, root):
if root:
self.inorder(root.left)
if self.latest != None:
if self.minDiff == None or root.val - self.latest < self.minDiff:
self.minDiff = root.val - self.latest
self.latest = root.val
self.inorder(root.right)

def minDiffInBST(self, root: Optional[TreeNode]) -> int:
self.minDiff = None
self.latest = None
self.inorder(root)
return self.minDiff
``````