Tap here to switch tabs
Problem
Submissions

Problem: Find Bottom Left Tree Value

Find Bottom Left Tree Value asks you to return the leftmost node value on the deepest level of a binary tree, including cases where node values may be negative.

Statement

Given the root of a binary tree, return the leftmost value located in the deepest level of the tree.

Constraints:

  • The number of nodes in the tree is in the range [1,104][1, 10^4].

  • −231≤-2^{31} \leq Node.val ≤231−1\leq 2^{31} - 1

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find Bottom Left Tree Value

Find Bottom Left Tree Value asks you to return the leftmost node value on the deepest level of a binary tree, including cases where node values may be negative.

Statement

Given the root of a binary tree, return the leftmost value located in the deepest level of the tree.

Constraints:

  • The number of nodes in the tree is in the range [1,104][1, 10^4].

  • −231≤-2^{31} \leq Node.val ≤231−1\leq 2^{31} - 1