python遍历二叉树的用列表存储

前序和中序，后序，遍历。

class TreeNode():
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    def findTarget(self, root: TreeNode):
        def inorder(root):

            if not root:
                return
            inorder(root.left)
            res.append(root.val)
            inorder(root.right)
        res = []
        inorder(root)
        return res


if __name__ == '__main__':
    s = Solution()

    n2 = TreeNode(2)
    n3 = TreeNode(1)
    n4 = TreeNode(3)

    n2.left = n3
    n2.right = n4

    print(s.findTarget(n2))