leetcode 二叉树右视图

class Solution:
    def rightSideView(self, root: TreeNode) -> List[int]:
        if not root:return []
        res=[]
        def bfs(root):
            queue=[root]
            while queue:
                res.append(queue[-1].val)
                tmp=[]
                for node in queue:
                    if node.left:tmp.append(node.left)
                    if node.right:tmp.append(node.right)
                queue=tmp
        bfs(root)
        return res