def inorderTravseral(self,root): if not root: return [] return self.inorderTravseral(root.left) + [root.val] + self.inorderTravseral(root.right)
def minDifference(self , root: TreeNode) -> int: re = self.inorderTravseral(root) ans = float('inf') for i in range(len(re)-2): ans = min(ans, re[i+1] - re[i]) return ans