题解 | #二叉树的中序遍历#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param root TreeNode类 
# @return int整型一维数组
#
# 和前序一样，只不过交换以下添加的顺序
class Solution:
    def inorderTraversal(self , root: TreeNode) -> List[int]:
        if not root:
            return None
        
        def midSequence(r):
            l = []
            if r.left:
                l.extend(midSequence(r.left))
            l.append(r.val)
            if r.right:
                l.extend(midSequence(r.right))
            return l
        
        return midSequence(root)