| | | 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.MaximumProductOfSplittedBinaryTree; |
| | | 15 | | |
| | | 16 | | /// <inheritdoc /> |
| | | 17 | | public sealed class MaximumProductOfSplittedBinaryTreeDepthFirstSearch : IMaximumProductOfSplittedBinaryTree |
| | | 18 | | { |
| | | 19 | | private const int Modulo = 1_000_000_007; |
| | | 20 | | |
| | | 21 | | /// <summary> |
| | | 22 | | /// Time complexity - O(n), where n is the number of nodes in the binary tree |
| | | 23 | | /// Space complexity - O(h), where h is the height of the tree |
| | | 24 | | /// </summary> |
| | | 25 | | /// <param name="root"></param> |
| | | 26 | | /// <returns></returns> |
| | | 27 | | public int MaxProduct(TreeNode root) |
| | 2 | 28 | | { |
| | 2 | 29 | | long maximumProduct = 0; |
| | | 30 | | |
| | 2 | 31 | | var totalSum = GetTotalSum(root); |
| | | 32 | | |
| | 2 | 33 | | FindMaximumProduct(root); |
| | | 34 | | |
| | 2 | 35 | | return (int)(maximumProduct % Modulo); |
| | | 36 | | |
| | | 37 | | long GetTotalSum(TreeNode treeNode) |
| | 12 | 38 | | { |
| | 12 | 39 | | long sum = treeNode.val; |
| | | 40 | | |
| | 12 | 41 | | if (treeNode.left != null) |
| | 5 | 42 | | { |
| | 5 | 43 | | sum += GetTotalSum(treeNode.left); |
| | 5 | 44 | | } |
| | | 45 | | |
| | 12 | 46 | | if (treeNode.right != null) |
| | 5 | 47 | | { |
| | 5 | 48 | | sum += GetTotalSum(treeNode.right); |
| | 5 | 49 | | } |
| | | 50 | | |
| | 12 | 51 | | return sum; |
| | 12 | 52 | | } |
| | | 53 | | |
| | | 54 | | long FindMaximumProduct(TreeNode treeNode) |
| | 12 | 55 | | { |
| | 12 | 56 | | long sum = treeNode.val; |
| | | 57 | | |
| | 12 | 58 | | if (treeNode.left != null) |
| | 5 | 59 | | { |
| | 5 | 60 | | sum += FindMaximumProduct(treeNode.left); |
| | 5 | 61 | | } |
| | | 62 | | |
| | 12 | 63 | | if (treeNode.right != null) |
| | 5 | 64 | | { |
| | 5 | 65 | | sum += FindMaximumProduct(treeNode.right); |
| | 5 | 66 | | } |
| | | 67 | | |
| | 12 | 68 | | var product = sum * (totalSum - sum); |
| | | 69 | | |
| | 12 | 70 | | maximumProduct = Math.Max(maximumProduct, product); |
| | | 71 | | |
| | 12 | 72 | | return sum; |
| | 12 | 73 | | } |
| | 2 | 74 | | } |
| | | 75 | | } |