Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Right View of Binary Tree
Easy Accuracy: 51.66% Submissions: 39249 Points: 2

Given a Binary Tree, find Right view of it. Right view of a Binary Tree is set of nodes visible when tree is viewed from right side.

Right view of following tree is 1 3 7 8.

1
/     \
2        3
/   \      /    \
4     5   6    7
\
8

Example 1:

Input:
1
/    \
3      2
Output: 1 2


Example 2:

Input:
10
/   \
20     30
/   \
40  60
Output: 10 30 60


Just complete the function rightView() that takes node as parameter and returns the right view as a list.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).

Constraints:
1 <= Number of nodes <= 105
1 <= Data of a node <= 105.

to report an issue on this page.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?