Back to course home

0% completed

# Solution: Problem Challenge 2: Right View of a Binary Tree

## Problem Statement

Given a binary tree, return an array containing nodes in its right view. The right view of a binary tree is the set of **nodes visible when the tree is seen from the right side**.

**Constraints:**

- The number of nodes in the tree is in the range
`[0, 100]`

. `-100 <= Node.val <= 100`

## Solution

This problem follows the **Binary Tree Level Order Traversal** pattern. We can follow the same **BFS** approach. The only additional thing we will be doing is to append the last node of each level to the result array.

**Here is the visual representation of the algorithm:**

.....

.....

.....

Like the course? Get enrolled and start learning!