binary-tree-right-side-view

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> 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.

&nbsp;
Example 1:

<div class="example-block">
Input: root = [1,2,3,null,5,null,4]

Output: [1,3,4]

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" />
</div>

Example 2:

<div class="example-block">
Input: root = [1,2,3,4,null,null,null,5]

Output: [1,3,4,5]

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" />
</div>

Example 3:

<div class="example-block">
Input: root = [1,null,3]

Output: [1,3]
</div>

Example 4:

<div class="example-block">
Input: root = []

Output: []
</div>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 100]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>

rightSideView

Binary Tree Right Side View

Populating Next Right Pointers in Each Node

populating-next-right-pointers-in-each-node

填充每个节点的下一个右侧节点指针

Boundary of Binary Tree

boundary-of-binary-tree

二叉树的边界

Tree

Depth-First Search

Breadth-First Search

Binary Tree

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

&nbsp;

示例 1：

<div class="example-block">
输入：root = [1,2,3,null,5,null,4]

输出：[1,3,4]

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" />
</div>

示例 2：

<div class="example-block">
输入：root = [1,2,3,4,null,null,null,5]

输出：[1,3,4,5]

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" />
</div>

示例 3：

<div class="example-block">
输入：root = [1,null,3]

输出：[1,3]
</div>

示例 4：

<div class="example-block">
输入：root = []

输出：[]

&nbsp;
</div>

提示:

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