-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
46 lines (38 loc) · 1.48 KB
/
Solution.cs
File metadata and controls
46 lines (38 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
public class Solution
{
public bool FlipEquiv(TreeNode root1, TreeNode root2)
{
if (root1 is null || root2 is null) return root1 == root2;
Queue<TreeNode> queue = [];
Queue<TreeNode> queue2 = [];
queue.Enqueue(root1);
queue2.Enqueue(root2);
while (queue.Count > 0 && queue2.Count > 0)
{
int length1 = queue.Count;
int length2 = queue2.Count;
if (length1 != length2) return false;
for (int i = 0; i < length1; i++)
{
var node1 = queue.Dequeue();
var node2 = queue2.Dequeue();
if (node1.val != node2.val) return false;
List<TreeNode> children1 = [];
List<TreeNode> children2 = [];
if (node1.left is not null) children1.Add(node1.left);
if (node1.right is not null) children1.Add(node1.right);
if (node2.left is not null) children2.Add(node2.left);
if (node2.right is not null) children2.Add(node2.right);
if (children1.Count != children2.Count) return false;
children1.Sort((a, b) => a.val - b.val);
children2.Sort((a, b) => a.val - b.val);
for (int j = 0; j < 2; j++)
{
queue.Enqueue(children1[j]);
queue.Enqueue(children2[j]);
}
}
}
return queue.Count == queue2.Count;
}
}