思路
对于每一层,我们进行如下操作:
(1) 存储当前层结点的值,使用一个curList
(2) 存储下一层结点(注意不是结点的值),使用一个nextLayer
同时,我们需要设置flag来判断当前层的值是否要逆序(偶数层需要逆序)
代码
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def Print(self, pRoot):
# write code here
# 判空
if not pRoot:
return []
resultList = []
curLayer = [pRoot]
flag = 1 # 控奇偶
while curLayer: # 对每一层进行操作
curList = [] # 存储当前层结点的值
nextLayer = [] # 存储下一层结点,用来替换curLayer
# for循环用来添加下一层的结点和当前层结点的值
for node in curLayer:
curList.append(node.val)
if node.left:
nextLayer.append(node.left)
if node.right:
nextLayer.append(node.right)
if flag % 2 == 0:curList.reverse() # 偶数层逆序
flag += 1
resultList.append(curList)
curLayer = nextLayer
return resultList