Problem Statement

Given a root of the binary tree, return an array containing nodes in its right view.

The right view of a binary tree consists of nodes that are visible when the tree is viewed from the right side. For each level of the tree, the last node encountered in that level will be included in the right view.

Examples

Example 1

• Input: root = [1, 2, 3, 4, 5, 6, 7]

• Expected Output: [1, 3, 7]
• Justification:
  • The last node at level 0 is 1.
  • The last node at level 1 is 3.
  • The last node at level 2 is 7.