• Home
• com.github.javadev
• leetcode-in-java11
• 1.4
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0101_0200.s0199_binary_tree_right_side_view.readme.md Maven / Gradle / Ivy

199\. Binary Tree Right Side View

Medium

Given the `root` of a binary tree, imagine yourself standing on the **right side** of it, return _the values of the nodes you can see ordered from top to bottom_.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/02/14/tree.jpg)

**Input:** root = \[1,2,3,null,5,null,4\]

**Output:** \[1,3,4\] 

**Example 2:**

**Input:** root = \[1,null,3\]

**Output:** \[1,3\] 

**Example 3:**

**Input:** root = \[\]

**Output:** \[\] 

**Constraints:**

*   The number of nodes in the tree is in the range `[0, 100]`.
*   `-100 <= Node.val <= 100`