目录
一、题目
1、LeetCode102:给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)。
2、LeetCode107:给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
二、示例
1、LeetCode102:
示例:
二叉树:[3,9,20,null,null,15,7],3
/ \
9 20
/ \
15 7
返回其层次遍历结果:[
[3],
[9,20],
[15,7]
]
2、LeetCode107:
示例:
给定二叉树 [3,9,20,null,null,15,7],3
/ \
9 20
/ \
15 7
返回其自底向上的层次遍历为:[
[15,7],
[9,20],
[3]
]
三、思路
1、LeetCode102:先序遍历的思想,depth变量用来记录遍历的层数,每向下一层递归,depth变量+1。
2、LeetCode107:同LeetCode102,不同的是,最后倒序的方式输出res中的值。
四、代码
1、LeetCode102:
# Definition for a binary tree node.
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def levelOrder(self, root: TreeNode):
res = []
def DFS(root, depth, res):
if not root:
return
if depth >= len(res):
res.append([])
res[depth].append(root.val)
DFS(root.left, depth + 1, res)
DFS(root.right, depth + 1, res)
DFS(root, 0, res)
return res
if __name__ == '__main__':
root = TreeNode(3)
root.left = TreeNode(9)
root.right = TreeNode(20)
root.right.left = TreeNode(15)
root.right.right = TreeNode(7)
s = Solution()
ans = s.levelOrder(root)
print(ans)
2、LeetCode107:
# Definition for a binary tree node.
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def levelOrderBottom(self, root: TreeNode):
res = []
def DFS(root, depth, res):
if not root:
return
if depth >= len(res):
res.append([])
res[depth].append(root.val)
DFS(root.left, depth + 1, res)
DFS(root.right, depth + 1, res)
DFS(root, 0, res)
return res[::-1]
if __name__ == '__main__':
root = TreeNode(3)
root.left = TreeNode(9)
root.right = TreeNode(20)
root.right.left = TreeNode(15)
root.right.right = TreeNode(7)
s = Solution()
ans = s.levelOrderBottom(root)
print(ans)