Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d1074f7

Browse files
added daily challenge
1 parent e0b8f0c commit d1074f7

File tree

1 file changed

+22
-0
lines changed

1 file changed

+22
-0
lines changed

‎513. Find Bottom Left Tree Value.py‎

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
# Definition for a binary tree node.
2+
# class TreeNode:
3+
# def __init__(self, val=0, left=None, right=None):
4+
# self.val = val
5+
# self.left = left
6+
# self.right = right
7+
class Solution:
8+
def findBottomLeftValue(self, root: Optional[TreeNode]) -> int:
9+
queue = deque([root])
10+
leftmost_value = None
11+
12+
while queue:
13+
node = queue.popleft()
14+
15+
leftmost_value = node.val
16+
17+
if node.right:
18+
queue.append(node.right)
19+
if node.left:
20+
queue.append(node.left)
21+
22+
return leftmost_value

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /