leecode102. Binary Tree Level Order Traversal二叉树层次遍历
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
** / \
*15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def levelOrder(self, root: TreeNode) -> List[List[int]]:
ans,level=[],[root]
while root and level:
ans.append([node.val for node in level])
lrp=[(node.left,node.right) for node in level]
level=[leaf for lr in lrp for leaf in lr if leaf]
return ans