Leetcode 94. 二叉树的中序遍历
class Solution:def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:self.res []def intree(node):if not node:return Noneintree(node.left)self.res.append(node.val)intree(node.right)intree(root)return self.res
2026/8/2 17:45:46