Version: v1.6.5 Latest Latest

This package is not in the latest version of its module.

Go to latest
Published: Mar 23, 2021 License: MIT Imports: 0 Imported by: 0


< Previous                  Next >

783. Minimum Distance Between BST Nodes (Easy)

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

Note: This question is the same as 530:


Example 1:

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

Example 2:

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



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

[Tree] [Depth-first Search] [Recursion]

Similar Questions

  1. Binary Tree Inorder Traversal (Medium)


The Go Gopher

There is no documentation for this package.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
t or T : Toggle theme light dark auto
y or Y : Canonical URL