-
Notifications
You must be signed in to change notification settings - Fork 49
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Day22 q2: Sum of Left Leaves #464
Comments
please this issue to me. |
Please assign it to me. |
Please assign this ques to me @bh-g @karishma-2020 |
please assign this question to me :) @bh-g |
1 similar comment
please assign this question to me :) @bh-g |
Closed
bh-g
added a commit
that referenced
this issue
Jan 24, 2024
day22-q2 solution added in python, java #464
please assign this issue to me. |
Akansha77
added a commit
to Akansha77/LeetCode_Q
that referenced
this issue
Jan 25, 2024
…d by Akansha77
@bh-g please assign this issue to me:) |
@bh-g Please assign for a solution in Python |
kratika-Jangid
added a commit
that referenced
this issue
Jan 27, 2024
Day22 q2: Sum of Left Leaves #464 , Day18 q1: max difference between Node and Ancestor .
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Given the
root
of a binary tree, return the sum of all left leaves.A leaf is a node with no children.
A left leaf is a leaf that is the left child of another node.
Example 1
Input: root = [3,9,20,null,null,15,7]
Output: 24
Explanation: There are two left leaves in the binary tree, with values 9 and 15 respectively.
Example 2
Input: root = [1]
Output: 0
Constraints:
[1, 1000]
.1000
<= Node.val <=1000
problem link:
https://leetcode.com/problems/sum-of-left-leaves/
The text was updated successfully, but these errors were encountered: