[LeetCode]199. 二叉树的右视图

199. 二叉树的右视图

难度：中等

给定一个二叉树的 根节点 root，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。

示例 1:

输入: [1,2,3,null,5,null,4]
输出: [1,3,4]

示例 2:

输入: [1,null,3]
输出: [1,3]

示例 3:

输入: []
输出: []

提示:

• 二叉树的节点个数的范围是 [0,100]
• -100 <= Node.val <= 100

---

解法一：层序遍历取每层最后一个

# 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]:
        def levelOrder(node, level):
            if not node:
                return
            res[level - 1].append(node.val)
            if len(res) == level:
                res.append([])
            levelOrder(node.left, level + 1)
            levelOrder(node.right, level + 1)

        res = [[]]
        levelOrder(root,1)
        
        for i in range(len(res) - 1):
            res[i] = res[i][-1]
        return res[:-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]:
        res = []
        def dfs(node, level = 0):
            if not node:
                return
            if len(res) == level:
                res.append(node.val)
            dfs(node.right, level + 1)
            dfs(node.left, level + 1)
        dfs(root)
        return res