二叉树的右视图

from collections import deque
class TreeNode:
    def __init__(____):
        self.val = val
        self.left = left
        self.right = right

def solve():
    def rightSideView(____):
        if not root:
            return []
        result = []
        queue = deque(____)
        while queue:
            level_size = len(____)
            for i in range(____):
                node = queue.popleft()
                if i == level_size - ____:
                    result.append(____)
                if node.left:
                    queue.append(____)
                if node.right:
                    queue.append(____)
        return result
    root = TreeNode(____, TreeNode(____, None, TreeNode(____)), TreeNode(____, None, TreeNode(____)))
    print(rightSideView(____))