给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)。
示例:
二叉树:[3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[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 levelOrder(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
层序遍历
"""
if root==None:
return []
res = []
stack = [root]
temp_stack = []
temp_res = []
while stack!=[]:
while stack!=[]:
temp_tree = stack.pop(0)
temp_res.append(temp_tree.val)
if temp_tree.left!=None:
temp_stack.append(temp_tree.left)
if temp_tree.right!=None:
temp_stack.append(temp_tree.right)
res.append(temp_res)
stack = temp_stack
temp_stack = []
temp_res = []
return res
给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [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(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]]
"""
if root==None:
return []
res = []
stack = [root]
temp_stack = []
temp_res = []
# 添加标记位
flag = 0
while stack!=[]:
while stack!=[]:
temp_tree = stack.pop(0)
temp_res.append(temp_tree.val)
if temp_tree.left!=None:
temp_stack.append(temp_tree.left)
if temp_tree.right!=None:
temp_stack.append(temp_tree.right)
# 当标记位为奇数时将结果反转
if flag&1:
temp_res = temp_res[::-1]
res.append(temp_res)
stack = temp_stack
temp_stack = []
temp_res = []
flag += 1
return res