• Home
• com.github.javadev
• leetcode-in-java21
• 1.30
• 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.

g0501_0600.s0513_find_bottom_left_tree_value.readme.md Maven / Gradle / Ivy

513\. Find Bottom Left Tree Value

Medium

Given the `root` of a binary tree, return the leftmost value in the last row of the tree.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg)

**Input:** root = [2,1,3]

**Output:** 1

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/12/14/tree2.jpg)

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

**Output:** 7

**Constraints:**

*   The number of nodes in the tree is in the range [1, 104].
*   -231 <= Node.val <= 231 - 1