<qiyuangong>094_Binary_Tree_Inorder_Traversal_1.py
def inorderTraversal( root):
    res = []
    if root is None:
        return res
    queue = [root]
    while len(queue) > 0:
        curr = queue.pop(0)
        if curr.left is None and curr.right is None:
            res.append(curr.val)
        else:
            if curr.right is not None:
                queue.insert(0, curr.right)
                curr.right = None
            queue.insert(0, curr)
            if curr.left is not None:
                queue.insert(0, curr.left)
                curr.left = None
    return res
def sample_funcname ( var_0 ) :
    var_1 = [ ]
    if var_0 is None :
        return var_1
    var_3 = [ var_0 ]
    while len ( var_3 ) > 0 :
        var_7 = var_3.pop ( 0 )
        if var_7.left is None and var_7.right is None :
            var_1.append ( var_7.val )
        else :
            if var_7.right is not None :
                var_3.insert ( 0 , var_7.right )
                var_7.right = None
            var_3.insert ( 0 , var_7 )
            if var_7.left is not None :
                var_3.insert ( 0 , var_7.left )
                var_7.left = None
    return var_1
