leetcode_binary tree right side view

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class :
    def rightSideView(self, root: TreeNode) -> List[int]:
        if not root:
            return []
       
        result = []
        stack = [root]
        while stack:
            result.append(stack[0].val)
            new_stack = []
            for node in stack:
                if node.right:
                    new_stack.append(node.right)
                if node.left:
                    new_stack.append(node.left)
            stack = new_stack
        
        return result