leetcode 94 二叉树的中序遍历

题目

给定一个二叉树，返回它的中序 遍历。

示例:

输入: [1,null,2,3]
   1
    \
     2
    /
   3

输出: [1,3,2]

进阶: 递归算法很简单，你可以通过迭代算法完成

代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def inorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        res = []
        if root == None:
            return
        s = []
        cur = root
        while (len(s) != 0) | (cur != None):
            while cur:
                s.append(cur)
                cur = cur.left
            cur = s.pop()
            res.append(cur.val)
            cur = cur.right
        return res