156. Binary Tree Right Side View

MediumTree

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.

Examples

Input: [1,2,3,null,5,null,4]

Output: [1,3,4]

Explanation: From the right side, you can see nodes 1, 3, and 4.

Constraints

  • The number of nodes in the tree is in the range [0, 100].
  • -100 <= Node.val <= 100
Loading...

Run checks all cases above. Submit evaluates all test cases.