Binary Tree Right Side View
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.

30:00

Binary Tree Right Side View
medium
Topics
Companies

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.

Example 1:
Input: {"root":[1,2,3,null,5,null,4]}
Output: [1,3,4]
Constraints:

  • The number of nodes is in the range [0,100][0, 100].

  • −100≤Node.val≤100-100 \leq \text{Node.val} \leq 100

Input
arr ={"root":[1,2,3,null,5,null,4]}

Start BFS

1

2

3

5

4

Variables
No variables to display
DepthFunction Call
Stack empty
0/20