Package g0501_0600.s0513_find_bottom_left_tree_value

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    Input: root = 2,1,3

    Output: 1

    Example 2:

    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 <code>1, 10<sup>4</sup></code>.

    • <code>-2<sup>31</sup><= Node.val <= 2<sup>31</sup> - 1</code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer findBottomLeftValue(TreeNode root)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait