摘要: 层序遍历 1、迭代法,使用队列 class Solution: def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]: res = [] if root is None: return res queue = [root] 阅读全文
posted @ 2023-10-24 21:37 忆象峰飞 阅读(11) 评论(0) 推荐(0)