Minimum Absolute Difference in BST LeetCode solution in Python

1
# Runtime: 46 ms (Top 97.4%) | Memory: 18.70 MB (Top 13.8%)
2

3

4
class Solution:
5
    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
6
        cur, stack, minDiff, prev = root, [], 10**5, -(10**5)
7

8
        while stack or cur:
9
            while cur:
10
                stack.append(cur)
11
                cur = cur.left
12
            node = stack.pop()
13
            minDiff = min(minDiff, node.val - prev)
14
            prev = node.val
15
            cur = node.right
16

17
        return minDiff