LwUNpT

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.

findBottomLeftValue

找树左下角的值

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给定一个二叉树的 根节点 <code>root</code>，请找出该二叉树的&nbsp;最底层&nbsp;最左边&nbsp;节点的值。

假设二叉树中至少有一个节点。

&nbsp;

示例 1：

<img src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 182px; " />

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

示例 2：

<img src="https://assets.leetcode.com/uploads/2020/12/14/tree2.jpg" style="width: 242px; " /> 

<pre>
输入: [1,2,3,4,null,5,6,null,null,7]
输出: 7
</pre>

&nbsp;

提示：

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

&nbsp;

<meta charset="UTF-8" />注意：本题与主站 513&nbsp;题相同：&nbsp;<a href="https://leetcode-cn.com/problems/find-bottom-left-tree-value/">https://leetcode-cn.com/problems/find-bottom-left-tree-value/</a>