Binary Tree Right Side View

Understand and solve the interview question "Binary Tree Right Side View".


You are given a binary tree T. Imagine you are standing to the right of it; you have to return the value of the nodes you can see from top to bottom.

You have to return the rightmost nodes on their respective levels in the form of an array.

Let’s discuss an example below:

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.