| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | using LeetCode.Core.Models; |
| | | 13 | | |
| | | 14 | | namespace LeetCode.Algorithms.SumOfLeftLeaves; |
| | | 15 | | |
| | | 16 | | /// <inheritdoc /> |
| | | 17 | | public class SumOfLeftLeavesBreadthFirstSearch : ISumOfLeftLeaves |
| | | 18 | | { |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(n) |
| | | 21 | | /// Space complexity - O(n) |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="root"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int SumOfLeftLeaves(TreeNode? root) |
| | 5 | 26 | | { |
| | 5 | 27 | | if (root == null) |
| | 0 | 28 | | { |
| | 0 | 29 | | return 0; |
| | | 30 | | } |
| | | 31 | | |
| | 5 | 32 | | var sum = 0; |
| | | 33 | | |
| | 5 | 34 | | var queue = new Queue<TreeNode>(); |
| | 5 | 35 | | queue.Enqueue(root); |
| | | 36 | | |
| | 28 | 37 | | while (queue.Count > 0) |
| | 23 | 38 | | { |
| | 23 | 39 | | var treeNode = queue.Dequeue(); |
| | | 40 | | |
| | 23 | 41 | | if (treeNode.left != null) |
| | 12 | 42 | | { |
| | 12 | 43 | | if (treeNode.left.left == null && treeNode.left.right == null) |
| | 6 | 44 | | { |
| | 6 | 45 | | sum += treeNode.left.val; |
| | 6 | 46 | | } |
| | | 47 | | else |
| | 6 | 48 | | { |
| | 6 | 49 | | queue.Enqueue(treeNode.left); |
| | 6 | 50 | | } |
| | 12 | 51 | | } |
| | | 52 | | |
| | 23 | 53 | | if (treeNode.right != null) |
| | 12 | 54 | | { |
| | 12 | 55 | | queue.Enqueue(treeNode.right); |
| | 12 | 56 | | } |
| | 23 | 57 | | } |
| | | 58 | | |
| | 5 | 59 | | return sum; |
| | 5 | 60 | | } |
| | | 61 | | } |