minimum_absolute_difference_in_bst

README

< Previous 　　　　　　　　　　　　　　　　 Next >

530. Minimum Absolute Difference in BST (Easy)

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example:

Input:

   1
    \
     3
    /
   2

Output:
1

Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).

 

Note: There are at least two nodes in this BST.

Related Topics

[Tree]

Similar Questions

1. K-diff Pairs in an Array (Easy)