algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0102.二叉树的层序遍历.md

Browse Source
This commit is contained in:
jianghongcheng
2023-05-03 19:48:57 -05:00
committed by GitHub
parent ce5b335b72
commit 0521f762d9
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0102.二叉树的层序遍历.md
View File

@ -178,12 +178,11 @@ python3代码：
# self.val = val # self.val = val
# self.left = left # self.left = left
# self.right = right # self.right = right
from collections import deque
class Solution: class Solution:
def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]: def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
if not root: if not root:
return [] return []
queue = deque([root]) queue = collections.deque([root])
result = [] result = []
while queue: while queue:
level = [] level = []