Binary Tree Right Side View

Statement

You are given a root of a binary tree that has n number of nodes. You have to return the right-side view in the form of a list.

A right-side view of a binary tree is the data of the nodes that are visible when the tree is viewed from the right side.

Constraints:

• $0 \leq$ n $\leq 100$
• $-100 \leq$ Node.data $\leq 100$

Examples