题目描述:
给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
示例:
给定二叉树[3,9,20,null,null,15,7],
返回锯齿形层次遍历如下:
[
[3],
[20,9],
[15,7]
]
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def zigzagLevelOrder(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
#若树为空,直接返回空list
if root == None:
return []
#用res保存最终结果,用layer保存当前层的节点,count表示层下标
res =[]
layer = [root]
count = 0
#当当前层不为空,则一直向下遍历。当count为偶数下标层时:正序保存节点值;当count为奇数下标层时:倒序保存节点值
while len(layer):
temp = []
if count%2 == 0:
for i in range(len(layer)):
temp.append(layer[i].val)
else:
for i in range(len(layer)):
temp.append(layer[len(layer)-1-i].val)
res.append(temp)
count = count + 1
layer_temp = []
for i in range(len(layer)):
if layer[i].left != None:
layer_temp.append(layer[i].left)
if layer[i].right != None:
layer_temp.append(layer[i].right)
layer = layer_temp
return res
菜鸟一枚,代码仅供参考,如有问题,望指正~