// Binary Tree Right Side View — MEDIUM

// Category: tree

Given the `root` of a binary tree, imagine yourself standing on the **right side** of it. Return the values of the nodes you can see ordered from top to bottom.

Use level-order traversal (BFS) and take the **last** element of each level.

Example: root = [1,2,3,null,5,null,4]

Output: [1,3,4]