Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes’ values.

Example
Given binary tree {1,#,2,3},

1
\
2
/
3

return [1,3,2].

Python:

    """
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
    self.val = val
    self.left, self.right = None, None
"""


class Solution:
"""
@param root: The root of binary tree.
@return: Inorder in ArrayList which contains node values.
"""
'''
# divide and conquer
def inorderTraversal(self, root):
    result = []
    if root is None:
        return result

    left = self.inorderTraversal(root.left)
    right = self.inorderTraversal(root.right)

    result.extend(left)
    result.append(root.val)
    result.extend(right)
    return result
'''

'''
# Traverse
def inorderTraversal(self, root):
    result = []
    self.helper(root, result)
    return result

def helper(self, root, result):
    if root is None:
        return 
    if root.left:
        self.helper(root.left, result)
    result.append(root.val)
    if root.right:
        self.helper(root.right, result)
'''

# non recursion
def inorderTraversal(self, root):
    if root is None:
        return []
    stack = []
    node = root
    result = []
    while node or stack:
        if node:
            stack.append(node)
            node = node.left
        else:
            node = stack.pop()
            result.append(node.val)
            node = node.right

    return result