Minimum Distance Between BST Nodes is an example of tree problems. In this post we will see how we can solve in Javascript.

Problem Description

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

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:

    /   \
  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.


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

Solution: Please check the main.js snippet for the solution. If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!