二叉树的锯齿形层次遍历
给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回锯齿形层次遍历如下:
[
[3],
[20,9],
[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 zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:
if not root:return []
queue,res = [],[]
queue.append(root)
while queue:
cl = []
for _ in range(len(queue)):
node = queue.pop(0)
cl.append(node.val)
if node.left:queue.append(node.left)
if node.right:queue.append(node.right)
res.append(cl)
temp = []
for i in range(len(res)):
if i%2 == 0:
temp.append(res[i])
else:
temp.append(res[i][::-1])
return (temp)
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:
ans = []
def dfs(root, level):
if not root:
return
if len(ans) < level:
ans.append([])
ans[level-1].append(root.val)
dfs(root.left, level+1)
dfs(root.right, level+1)
dfs(root, 1)
for i in range(len(ans)):
if i % 2 == 1:
ans[i] = ans[i][::-1]
return ans