| | | 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.MinimumDepthOfBinaryTree; |
| | | 15 | | |
| | | 16 | | /// <inheritdoc /> |
| | | 17 | | public class MinimumDepthOfBinaryTreeBreadthFirstSearch : IMinimumDepthOfBinaryTree |
| | | 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 MinDepth(TreeNode? root) |
| | 3 | 26 | | { |
| | 3 | 27 | | if (root == null) |
| | 1 | 28 | | { |
| | 1 | 29 | | return 0; |
| | | 30 | | } |
| | | 31 | | |
| | 2 | 32 | | var minDepth = int.MaxValue; |
| | | 33 | | |
| | 2 | 34 | | var nodeDepthQueue = new Queue<(TreeNode node, int depth)>(); |
| | | 35 | | |
| | 2 | 36 | | nodeDepthQueue.Enqueue((root, 1)); |
| | | 37 | | |
| | 12 | 38 | | while (nodeDepthQueue.Count > 0) |
| | 10 | 39 | | { |
| | 10 | 40 | | var (node, depth) = nodeDepthQueue.Dequeue(); |
| | | 41 | | |
| | 10 | 42 | | if (depth > minDepth) |
| | 2 | 43 | | { |
| | 2 | 44 | | continue; |
| | | 45 | | } |
| | | 46 | | |
| | 8 | 47 | | if (node.left == null && node.right == null) |
| | 2 | 48 | | { |
| | 2 | 49 | | minDepth = Math.Min(minDepth, depth); |
| | 2 | 50 | | } |
| | | 51 | | |
| | 8 | 52 | | if (node.left != null) |
| | 2 | 53 | | { |
| | 2 | 54 | | nodeDepthQueue.Enqueue((node.left, depth + 1)); |
| | 2 | 55 | | } |
| | | 56 | | |
| | 8 | 57 | | if (node.right != null) |
| | 6 | 58 | | { |
| | 6 | 59 | | nodeDepthQueue.Enqueue((node.right, depth + 1)); |
| | 6 | 60 | | } |
| | 8 | 61 | | } |
| | | 62 | | |
| | 2 | 63 | | return minDepth; |
| | 3 | 64 | | } |
| | | 65 | | } |