思路:层次遍历,每层的最后一个节点即为该层深度所看到的右侧节点。
层次遍历
# 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: Optional[TreeNode]) -> List[int]:
if not root:
return []
que = [root]
res = []
while que:
n = len(que)
while n:
node = que.pop(0)
if n == 1:
res.append(node.val)
if node.left:
que.append(node.left)
if node.right:
que.append(node.right)
n -= 1
return res