Binary Tree Right Side View
Explore how to determine the right side view of a binary tree by applying depth-first search strategies. This lesson guides you through understanding the problem requirements, constraints, and building the solution step-by-step to efficiently identify visible nodes from the right side.
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:
-
n -
Node.data
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
What will be the output of the following tree?
______ 1 ______
| |
2 _ _ 3
| |
_ 4 _ 5
| |
6 7 [1, 3, 5, 7]
[1, 3, 5]
[1, 4, 5, 7]
[1, 2, 3, 5]
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.
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.
import {TreeNode} from './ds_v1/BinaryTree.js';// Definition of a binary tree node// class TreeNode {// constructor(data) {// this.data = data;// this.left = null;// this.right = null;// }// }function rightSideView(root) {// Replace this placeholder return statement with your codereturn [];}export { rightSideView }