# Leetcode 530 - Min absolute diff in bst

Note:

• Because it’s a BST, then its inorder traversal in in ascdending order.
• Iterate the inorder traversal and we can find the result.

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

Example