94. 二叉树的中序遍历

思路
中序遍历的遍历顺序：左子树、根、右子树

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def inorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        s = []
        def traversal(root):
            if root is None:
                return 
            traversal(root.left)
            s.append(root.val)
            traversal(root.right)
        traversal(root)
        return s