comefrom: <garvit244>94_1.py
code: def inorderTraversal( root):
      if not root:
          return []
      
      stack, result = [root], []
      while stack:
          if root.left:
              stack.append(root.left)
              root = root.left
          else:
              node = stack.pop()
              result.append(node.val)
              
              if node.right:
                  stack.append(node.right)
                  root = node.right
      return result
masked: def sample_funcname ( var_0 ) :
      if not var_0 :
          return [ ]
      var_1 , var_2 = [ var_0 ] , [ ]
      while var_1 :
          if var_0.left :
              var_1.append ( var_0.left )
              var_0 = var_0.left
          else :
              var_6 = var_1.pop ( )
              var_2.append ( var_6.val )
              if var_6.right :
                  var_1.append ( var_6.right )
                  var_0 = var_6.right
      return var_2
  