0199.Binary Tree Right Side View

Link:
Track: Amazon Tag

Question

Restate the problem

---

Method 1
Method 2

Method

Approach

(discussed at lease two approach?)

Complexity

• Time Complexity:
• Space Complexity:

Edge Case

Code

class Solution:
    def rightSideView(self, root: Optional[TreeNode]) -> List[int]:
        if not root:
            return []
        
        res = []
        queue = deque()
        queue.append(root)
        while queue:
            size = len(queue)
            res.append(queue[-1].val)
            for _ in range(size):
                node = queue.popleft()
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
 
        return res

---

History

• Feb-11-2026 Solved