comefrom: <doocs>1123.Lowest Common Ancestor of Deepest Leaves_1.py
code: def dfs(root):
      if root is None:
          return None, 0
      l, d1 = dfs(root.left)
      r, d2 = dfs(root.right)
      if d1 > d2:
          return l, d1 + 1
      if d1 < d2:
          return r, d2 + 1
      return root, d1 + 1
masked: def sample_funcname ( var_1 ) :
      if var_1 is None :
          return None , 0
      var_4 , var_6 = var_0 ( var_1.left )
      var_7 , var_9 = var_0 ( var_1.right )
      if var_6 > var_9 :
          return var_4 , var_6 + 1
      if var_6 < var_9 :
          return var_7 , var_9 + 1
      return var_1 , var_6 + 1
  