LC-Minimum Distance Between BST Nodes

# Definition for a binary tree node.
class TreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None

class Solution(object):
    def minDiffInBST(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        list = []
        def dfs(node):
            if not node:
                return
            else:
                dfs(node.left)
                list.append(node.val)
                dfs(node.right)
        dfs(root)
        min = 10 ** 100
        for i in range(len(list)-1):
            if list[i+1] - list[i] < min:
                min = list[i+1] - list[i]
        return min

0，跟Minimum Absolute Difference in BST的代码是完全相同的。
1，题目要求：

2，参考上上上个博客