| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.MaximumLevelSumOfBinaryTree; |
| | | 15 | | |
| | | 16 | | /// <inheritdoc /> |
| | | 17 | | public sealed class MaximumLevelSumOfBinaryTreeBreadthFirstSearch : IMaximumLevelSumOfBinaryTree |
| | | 18 | | { |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(n), where n is the number of nodes in the binary tree |
| | | 21 | | /// Space complexity - O(w), where w is the maximum width of the tree |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="root"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int MaxLevelSum(TreeNode root) |
| | 4 | 26 | | { |
| | 4 | 27 | | var maxSum = int.MinValue; |
| | 4 | 28 | | var minLevel = 1; |
| | 4 | 29 | | var level = 1; |
| | | 30 | | |
| | 4 | 31 | | var queue = new Queue<TreeNode>(); |
| | | 32 | | |
| | 4 | 33 | | queue.Enqueue(root); |
| | | 34 | | |
| | 15 | 35 | | while (queue.Count > 0) |
| | 11 | 36 | | { |
| | 11 | 37 | | var count = queue.Count; |
| | | 38 | | |
| | 11 | 39 | | var sum = 0; |
| | | 40 | | |
| | 56 | 41 | | for (var i = 0; i < count; i++) |
| | 17 | 42 | | { |
| | 17 | 43 | | var node = queue.Dequeue(); |
| | | 44 | | |
| | 17 | 45 | | sum += node.val; |
| | | 46 | | |
| | 17 | 47 | | if (node.left is not null) |
| | 6 | 48 | | { |
| | 6 | 49 | | queue.Enqueue(node.left); |
| | 6 | 50 | | } |
| | | 51 | | |
| | 17 | 52 | | if (node.right is not null) |
| | 7 | 53 | | { |
| | 7 | 54 | | queue.Enqueue(node.right); |
| | 7 | 55 | | } |
| | 17 | 56 | | } |
| | | 57 | | |
| | 11 | 58 | | if (sum > maxSum) |
| | 7 | 59 | | { |
| | 7 | 60 | | maxSum = sum; |
| | 7 | 61 | | minLevel = level; |
| | 7 | 62 | | } |
| | | 63 | | |
| | 11 | 64 | | level++; |
| | 11 | 65 | | } |
| | | 66 | | |
| | 4 | 67 | | return minLevel; |
| | 4 | 68 | | } |
| | | 69 | | } |