LeetCode 513. Find Bottom Left Tree Value(Medium)

最新推荐文章于 2026-06-20 22:09:08 发布

原创最新推荐文章于 2026-06-20 22:09:08 发布 · 165 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode

LeetCode 专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一种高效算法，用于在给定的二叉树中找到最底层最左边的节点的值。通过深度优先搜索(DFS)进行预序遍历，我们可以在O(n)的时间复杂度内解决此问题，其中n为二叉树中的节点数。文章详细解释了算法的实现过程，包括设置变量、递归遍历以及更新最大层级和结果。

Description:
Given a binary tree, find the leftmost value in the last row of the tree.
Example 1:

Input:

    2
   / \
  1   3

Output:
1

Example 2:
Input:

Note: You may assume the tree (i.e., the given root node) is not NULL

Analysis:
When we execute pre-order traversal, the leftmost node of a row is the first one that will be explored among the nodes in the same row. We can use this feature to help us solve this problem.

Firstly, setting two object variables maxLevel, result which represent the max level that we have reached and the solution to the problem respectively.
Do the pre-order traverse, each time when the level of the node we are visiting is larger than maxLevel, this node must be the leftmost node of the current level. Then we use the current level to update maxLevel and the value of the node we are visiting to update result.

Time complexity: $O (n)$
Space complexity: $O (n)$

Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int maxLevel = 0;
    public int result = 0;
    
    public int findBottomLeftValue(TreeNode root) {
        dfs(root, 1);
        
        return result;
    }
    
    public void dfs(TreeNode node, int level) {
        if(node == null) {
            return;
        }else{
            if(level > maxLevel) {
                maxLevel = level;
                result = node.val;
            }
            if(node.left != null) {
                dfs(node.left, level+1);
            }
            if(node.right != null) {
                dfs(node.right, level+1);
            }
        }
    }
}