二叉搜索数中最近的值 lintcode 900

给定一棵二叉搜索数和一个target值，要你输出二叉搜索树中里target值最近的值。

用中序遍历，到当前节点，判断一下如果当前节点和target值的差的绝对值比历史的要小，就更新min_dff，min_diff_key，然后继续遍历直到节点为空。如果当前节点为空，直接返回。如果当前节点等于target，更新min_diff，min_diff_key后返回 。当前节点处理完，如果target比当前节点要小，往左边走，如果target比当前节点要大，往右边走。min_diff ，min_diff_key分别是遍历到当前节点为止节点和target的绝对值之差的最小值和这个节点的值。

树为空或target为空直接返回不进行任何的遍历。
时间复杂度：O(h)，h为树高，最高是n，最矮是log_2(n)向下取整，2为底数，n为节点个数。

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: the given BST
    @param target: the given target
    @return: the value in the BST that is closest to the target
    """
    def find_min_key(self, node, min_diff, min_diff_key, target):
        # print("node.val, min_diff, min_diff_key[0], target:{},{},{},{}".format(node.val, min_diff, min_diff_key[0], target))
        if node is None:
            return
        if node.val == target:
            min_diff = 0
            min_diff_key[0] = node.val
        
        if abs(node.val-target) < min_diff:
            min_diff = abs(node.val-target)
            min_diff_key[0] = node.val
        
        if node.val < target:
            self.find_min_key(node.right, min_diff, min_diff_key, target)
        else:
            self.find_min_key(node.left, min_diff, min_diff_key, target)
        
 

    def closestValue(self, root, target):
        # write your code here
        if root is None or target is None:
            return None 
        min_diff, min_diff_key = float('inf'), [-1]# 如果是-1，是值传递，函数内更改后出了函数还是原来的，加个中括号变成列表就是引用传递了

        self.find_min_key(root, min_diff, min_diff_key, target)
        return min_diff_key[0]