199. 二叉树的右视图
题目描述
解题思路
1、二叉树层次遍历,只输出每层最右侧节点值
代码实现
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def rightSideView(self, root: TreeNode) -> List[int]:
# 二叉树层次遍历,只输出每层最右侧节点值
if not root:
return []
arr = [root]
res = []
while arr:
size = len(arr)
for i in range(size):
node = arr.pop(0)
if node.left:
arr.append(node.left)
if node.right:
arr.append(node.right)
if i == size - 1:
res.append(node.val)
return res
参考文献
1、Sweetiee