# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param pRoot TreeNode类
# @return int整型二维数组
#
from queue import deque
class Solution:
def Print(self , pRoot: TreeNode) -> List[List[int]]:
# write code here
res = []
if not pRoot:
return res
queue = deque([pRoot])
mark = 0
while queue:
current = []
for i in range(len(queue)):
top = queue.popleft()
if top.left:
queue.append(top.left)
if top.right:
queue.append(top.right)
current.append(top.val)
if mark%2:
current = current[::-1]
mark += 1
res.append(current)
return res