Right Side View 20 XP Medium

Imagine standing on the right side of a binary tree. Return the values of the nodes you can see, ordered from top to bottom.

This is a BFS variation — at each level, the last node is what you see from the right:

• Do a normal level-order traversal (BFS)
• At each level, keep only the last value
• Alternatively: use DFS visiting right child first at each depth

Time: O(n), Space: O(n). A simple twist on level-order traversal!