WNC0Lk

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

English description is not available for the problem. Please switch to Chinese.

rightSideView

二叉树的右视图

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给定一个二叉树的 根节点 <code>root</code>，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。

&nbsp;

示例 1：

<img src="https://assets.leetcode.com/uploads/2021/02/14/tree.jpg" style="width: 270px; " />

<pre>
输入:&nbsp;[1,2,3,null,5,null,4]
输出:&nbsp;[1,3,4]
</pre>

示例 2：

<pre>
输入:&nbsp;[1,null,3]
输出:&nbsp;[1,3]
</pre>

示例 3：

<pre>
输入:&nbsp;[]
输出:&nbsp;[]
</pre>

&nbsp;

提示：

<ul>
	<li>二叉树的节点个数的范围是 <code>[0,100]</code></li>
	<li><meta charset="UTF-8" /><code>-100&nbsp;&lt;= Node.val &lt;= 100</code>&nbsp;</li>
</ul>

&nbsp;

<meta charset="UTF-8" />注意：本题与主站 199&nbsp;题相同：<a href="https://leetcode-cn.com/problems/binary-tree-right-side-view/">https://leetcode-cn.com/problems/binary-tree-right-side-view/</a>