mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
Update 0102.二叉树的层序遍历.md
This commit is contained in:
@ -178,12 +178,11 @@ python3代码:
|
||||
# self.val = val
|
||||
# self.left = left
|
||||
# self.right = right
|
||||
from collections import deque
|
||||
class Solution:
|
||||
def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
|
||||
if not root:
|
||||
return []
|
||||
queue = deque([root])
|
||||
queue = collections.deque([root])
|
||||
result = []
|
||||
while queue:
|
||||
level = []
|
||||
|
Reference in New Issue
Block a user