Follow the process of exploring tree structures and implementing various binary tree problems.

Coding

Tree Depth-First Search

Efficiently prepare for coding interviews with strategies from FAANG engineers. Avoid the LeetCode grind and simplify your interview prep with real-world questions from top companies.

The ultimate guide to the System Design Interview – developed by Meta & Google engineers. Master distributed system fundamentals, and practice with real-world interview questions & mock interviews.

System Design

The essential guide to API Design & Product Design Interviews – developed by FAANG engineers. Master product design fundamentals & get hands-on with real-world APIs.

API Design

A battle-tested guide to Object Oriented Design Interviews – developed by FAANG engineers. Master OOD fundamentals & practice real-world interview questions.

Low Level Design Interview Using OOD Principles

Your essential EM Interview crash course. Learn strategies from FAANG hiring managers to demonstrate your leadership skills & experience to interviewers.

Engineering Management and Leadership Interviews

The ultimate guide to behavioral interviews. Developed by FAANG engineers. Use real-world questions, video recording, and structured strategies to get interview-ready in just a few hours.

Behavioral

# 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 \leq$ `n` $\leq 100$
- $-100 \leq$ `Node.data` $\leq 100$

# Examples

Try to solve the Binary Tree Right Side View problem.

Problem: Binary Tree Right Side View

Statement

Examples

Problem: Binary Tree Right Side View

Statement

Examples