LC530. 二叉搜索树的最小绝对差

中序遍历迭代

def getMinimumDifference(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        pre = None
        res = 10**4
        stack = []
        while stack or root:
            if root:
                stack.append(root)
                root = root.left
            else:
                tmp = stack.pop()
                if pre:
                    res = min(tmp.val-pre.val,res)
                pre = tmp
                root = tmp.right
        return res

中序遍历递归

def getMinimumDifference(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.res = 10**4
        self.pre = -1
        def dfs(root):
            if not root:
                return 
            dfs(root.left)
            if self.pre == -1:
                self.pre = root.val
            else:
                self.res = min(self.res,root.val - self.pre)
                self.pre = root.val
            dfs(root.right)
        dfs(root)
        return self.res