comefrom: <qiyuangong>094_Binary_Tree_Inorder_Traversal_2.py
code: def inorderTraversal( root):
      res = []
      stack = []
      while root is not None:
          stack.append(root)
          root = root.left
          while root is None:
              if len(stack) == 0:
                  return res
              root = stack.pop()
              res.append(root.val)
              root = root.right
      return res
masked: def sample_funcname ( var_0 ) :
      var_1 = [ ]
      var_2 = [ ]
      while var_0 is not None :
          var_2.append ( var_0 )
          var_0 = var_0.left
          while var_0 is None :
              if len ( var_2 ) == 0 :
                  return var_1
              var_0 = var_2.pop ( )
              var_1.append ( var_0.val )
              var_0 = var_0.right
      return var_1
  