**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Binary Tree Right Side View** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
BFS: last node per level OR DFS right-first
**Edge Cases to Consider:**
- (1) Empty tree
- (2) Only left children
- (3) Alternating left/right children
Examples
Example 1
Input:[1,2,3,null,5,null,4]
Output:[1,3,4]
Explanation: Classic right view
Example 2
Input:[1,null,3]
Output:[1,3]
Explanation: Right-only
Example 3
Input:[]
Output:[]
Explanation: Empty tree
Constraints
▪The number of nodes in the tree is in the range [0, 2000]
▪-1000 <= Node.val <= 1000
▪Ensure depth-first or breadth-first traversals are memory-efficient