-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
TwoMirrorTrees.cpp
102 lines (78 loc) · 2.26 KB
/
TwoMirrorTrees.cpp
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
// Tree Node
struct Node {
int data;
Node *left;
Node *right;
Node(int val) {
data = val;
left = right = NULL;
}
};
// Function to Build Tree
Node *buildTree(string str) {
// Corner Case
if (str.length() == 0 || str[0] == 'N') return NULL;
// Creating vector of strings from input
// string after spliting by space
vector<string> ip;
istringstream iss(str);
for (string str; iss >> str;) ip.push_back(str);
// Create the root of the tree
Node *root = new Node(stoi(ip[0]));
// Push the root to the queue
queue<Node *> queue;
queue.push(root);
// Starting from the second element
int i = 1;
while (!queue.empty() && i < ip.size()) {
// Get and remove the front of the queue
Node *currNode = queue.front();
queue.pop();
// Get the current Node's value from the string
string currVal = ip[i];
// If the left child is not null
if (currVal != "N") {
// Create the left child for the current Node
currNode->left = new Node(stoi(currVal));
// Push it to the queue
queue.push(currNode->left);
}
// For the right child
i++;
if (i >= ip.size()) break;
currVal = ip[i];
// If the right child is not null
if (currVal != "N") {
// Create the right child for the current Node
currNode->right = new Node(stoi(currVal));
// Push it to the queue
queue.push(currNode->right);
}
i++;
}
return root;
}
int areMirror(Node *, Node *);
int main() {
int tc;
scanf("%d ", &tc);
while (tc--) {
string treeString1, treeString2;
getline(cin, treeString1);
Node *root1 = buildTree(treeString1);
getline(cin, treeString2);
Node *root2 = buildTree(treeString2);
cout<< areMirror(root1, root2) << "\n";
}
return 0;
}// } Driver Code Ends
int areMirror(Node* a, Node* b) {
if(a==NULL && b==NULL)
return true;
if(a==NULL || b==NULL)
return false;
return areMirror(a->left,b->right) && areMirror(a->right,b->left)&& (a->data==b->data);
}