comefrom: <qiyuangong>270_Closest_Binary_Search_Tree_Value_1.py
code: def closestValue( root, target):
      path = []
      while root:
          path += root.val,
          root = root.left if target < root.val else root.right
      return min(path, key=lambda x: abs(target - x))
masked: def sample_funcname ( var_0 , var_1 ) :
      var_2 = [ ]
      while var_0 :
          var_2 += var_0.val ,
          var_0 = var_0.left if var_1 < var_0.val else var_0.right
      return min ( var_2 , var_7 = lambda var_8 : abs ( var_1 - var_8 ) )
  