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

sys.setrecursionlimit(3000)
class Solution:
    def inorderTraversal(self , root: TreeNode) -> List[int]:
        # write code here
        result=[]
        def in_order(root):
            if root:
                in_order(root.left)
                result.append(root.val)
                in_order(root.right)
        in_order(root)
        return result