# -*- coding:utf-8 -*-
"""
@author: Alden
@email: <EMAIL>
@date: 2018/3/29
@version: 1.0.0.0
"""


# 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
        """


if __name__ == "__main__":
    s = Solution()
    s.minDiffInBST(None)

# -*- coding:utf-8 -*-
"""
@author: Alden
@email: <EMAIL>
@date: 2018/3/29
@version: 1.0.0.0
"""


# 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
        """


if __name__ == "__main__":
    s = Solution()
    s.minDiffInBST(None)

# -*- coding:utf-8 -*- @author: Alden @email: <EMAIL> @date: 2018/3/29 @version: 1.0.0.0 # Definition for a binary tree node. :type root: TreeNode         :rtype: int