Given the root of a binary tree, return the right side view of the tree. The right side view shows the rightmost node at each level when viewed from the right side.
Examples
// Example tree:// 1// / \// 2 3// \ \// 5 4// Right side view: [1, 3, 4]// Level 0: 1 (rightmost)// Level 1: 3 (rightmost)// Level 2: 4 (rightmost)
Constraints
The number of nodes in the tree is in the range [0, 100]