Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Binary Tree Right Side View

Explore how to identify and return the right side view of a binary tree by traversing its nodes with depth-first search. This lesson helps you understand how to visualize tree structures from the right perspective and implement a solution that captures the visible nodes. By the end, you will confidently develop code to solve similar tree traversal challenges using strategic assessment of node visibility.

We'll cover the following...

Statement

You are given a root of a binary tree that has n number of nodes. You have to return the right-side view in the form of a list.

A right-side view of a binary tree is the data of the nodes that are visible when the tree is viewed from the right side.

Constraints:

  • 0≤0 \leq n ≤100\leq 100
  • −100≤-100 \leq Node.data ≤100\leq 100

Examples

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Binary Tree Right Side View

1.

What will be the output of the following tree?

      ______ 1 ______ 
     |               |
     2 _           _ 3  
        |         |
      _ 4 _       5 
     |     |  
     6     7
A.

[1, 3, 5, 7]

B.

[1, 3, 5]

C.

[1, 4, 5, 7]

D.

[1, 2, 3, 5]

1 / 3

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4
5

Try it yourself

Implement your solution in the following coding playground.

Need a nudge?

Explore these hints—each one is designed to guide you a step closer to the solution.

Python
usercode > main.py
from ds_v1.BinaryTree.BinaryTree import TreeNode



# Definition for a binary tree node

# class TreeNode:

#     def __init__(self, data):

#         self.data = data

#         self.left = None

#         self.right = None



def right_side_view(root):

  

  # Replace this placeholder return statement with your code

  return []
Binary Tree Right Side View