Merge pull request #571 from Nixiak-nan/master

Update 0513.找树左下角的值.md
This commit is contained in:
程序员Carl
2021-08-07 15:28:23 +08:00
committed by GitHub
2 changed files with 2 additions and 1 deletions

View File

@ -249,7 +249,6 @@ class Solution {
```java
// 代码精简版
class Solution {
TreeNode pre;
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root == null || root.val == p.val ||root.val == q.val) return root;
TreeNode left = lowestCommonAncestor(root.left,p,q);

View File

@ -9,6 +9,8 @@
## 513.找树左下角的值
题目地址:[https://leetcode-cn.com/problems/find-bottom-left-tree-value/](https://leetcode-cn.com/problems/find-bottom-left-tree-value/v)
给定一个二叉树,在树的最后一行找到最左边的值。
示例 1: