| | | 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.SymmetricTree; |
| | | 15 | | |
| | | 16 | | /// <inheritdoc /> |
| | | 17 | | public class SymmetricTreeIterative : ISymmetricTree |
| | | 18 | | { |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(n) |
| | | 21 | | /// Space complexity - O(log n) for a balanced tree, O(n) for an unbalanced tree |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="root"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public bool IsSymmetric(TreeNode? root) |
| | 3 | 26 | | { |
| | 3 | 27 | | if (root == null) |
| | 1 | 28 | | { |
| | 1 | 29 | | return true; |
| | | 30 | | } |
| | | 31 | | |
| | 2 | 32 | | var queue = new Queue<TreeNode?>(); |
| | | 33 | | |
| | 2 | 34 | | queue.Enqueue(root.left); |
| | 2 | 35 | | queue.Enqueue(root.right); |
| | | 36 | | |
| | 10 | 37 | | while (queue.Count > 0) |
| | 9 | 38 | | { |
| | 9 | 39 | | var left = queue.Dequeue(); |
| | 9 | 40 | | var right = queue.Dequeue(); |
| | | 41 | | |
| | 9 | 42 | | if (left == null && right == null) |
| | 4 | 43 | | { |
| | 4 | 44 | | continue; |
| | | 45 | | } |
| | | 46 | | |
| | 5 | 47 | | if (left == null || right == null) |
| | 1 | 48 | | { |
| | 1 | 49 | | return false; |
| | | 50 | | } |
| | | 51 | | |
| | 4 | 52 | | if (left.val != right.val) |
| | 0 | 53 | | { |
| | 0 | 54 | | return false; |
| | | 55 | | } |
| | | 56 | | |
| | 4 | 57 | | queue.Enqueue(left.left); |
| | 4 | 58 | | queue.Enqueue(right.right); |
| | 4 | 59 | | queue.Enqueue(left.right); |
| | 4 | 60 | | queue.Enqueue(right.left); |
| | 4 | 61 | | } |
| | | 62 | | |
| | 1 | 63 | | return true; |
| | 3 | 64 | | } |
| | | 65 | | } |