LeetCode刷题记录
1.从上到下打印二叉树II
从上倒下按层打印二叉树,同一层的节点按从左到右的顺序打印,每一层打印到一行。
题解:
# 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]]:
if not root:return []
res , queue = [], collections.deque()
queue.append(root)
while queue:
tem = []
for _ in range(len(queue)):
node = queue.popleft()
tem.append(node.val)
if node.left:queue.append(node.left)
if node.right:queue.append(node.right)
res.append(tem)
return res
2.从上到下打印二叉树
请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照