Minimum Absolute Difference In Bst - Leetcode Solution

The problem of finding the minimum absolute difference in BST on Leetcode can be solved using an iterative approach. The basic idea behind the algorithm is to traverse the BST in Inorder sequence and find the minimum difference between adjacent elements.

1. Create an empty stack and initialize it with the root of the BST.

2. Set the current node to the left child of the root node.

3. Traverse the BST in Inorder sequence using the stack. If the stack is not empty or the current node is not NULL,

   a. Push the current node into the stack.

   b. Set the current node to its left child.

4. When the stack is empty or the current node is NULL, pop the last node from the stack.

5. Calculate the absolute difference between the last node and the current node.

6. If the absolute difference is less than the minimum absolute difference, update the value of the minimum absolute difference.

7. Set the last node to the current node.

8. Set the current node to the right child of the last node.

9. Repeat steps 3 to 8 until the stack is empty and the current node is NULL.

10. Return the minimum absolute difference.

The time complexity of the above algorithm is O(n), where n is the number of nodes in the BST. The space complexity of the algorithm is O(h), where h is the height of the BST.

1