Binary Tree Right Side View

Medium

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

Example 1

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

Example 2

Input:  root = [1,null,3]
Output: [1,3]

Constraints

• 0 <= number of nodes <= 100
• -100 <= Node.val <= 100