find-largest-value-in-each-tree-row

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given the <code>root</code> of a binary tree, return an array of the largest value in each row of the tree (0-indexed).

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; height: 172px;" />
<pre>
Input: root = [1,3,2,5,3,null,9]
Output: [1,3,9]
</pre>

Example 2:

<pre>
Input: root = [1,2,3]
Output: [1,3]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree will be in the range <code>[0, 104]</code>.</li>
	<li><code>-231 &lt;= Node.val &lt;= 231 - 1</code></li>
</ul>

largestValues

Find Largest Value in Each Tree Row

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给定一棵二叉树的根节点&nbsp;<code>root</code> ，请找出该二叉树中每一层的最大值。

&nbsp;

示例1：

<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="height: 172px; width: 300px;" />

<pre>
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
</pre>

示例2：

<pre>
输入: root = [1,2,3]
输出: [1,3]
</pre>

&nbsp;

提示：

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

&nbsp;