parameters: (self, root)
return_statement: return res
docstring: :type root: TreeNode
          :rtype: List[int]
docstring_summary: :type root: TreeNode
          :rtype: List[int]
docstring_tokens: : type root : TreeNode : rtype : List [ int ]
function: def inorderTraversal(self, root):
          """
          :type root: TreeNode
          :rtype: List[int]
          """
          if root is None:
              return []
          
          stack = []
          cur = root
          res = []
          
          while(cur is not None or len(stack) > 0):
              
              while cur is not None:
                  stack.append(cur)
                  cur = cur.left
              
              cur = stack.pop()
              res.append(cur.val)
              
              cur = cur.right
                  
          return res
function_tokens: def inorderTraversal ( self , root ) : if root is None : return [ ] stack = [ ] cur = root res = [ ] while ( cur is not None or len ( stack ) > 0 ) : while cur is not None : stack . append ( cur ) cur = cur . left cur = stack . pop ( ) res . append ( cur . val ) cur = cur . right return res