-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathQ 301 - Trees - Height of a Binary Tree.java
187 lines (87 loc) · 3.49 KB
/
Q 301 - Trees - Height of a Binary Tree.java
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
class Solution {
public static void main(String args[] ) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = br.readLine();
String[] initChar = line.split(" ");
int N = Integer.parseInt(initChar[0]);
Map<Integer, Node> nodeMap = new HashMap<>();
Map<Integer, Node> nodeMap1 = new HashMap<>();
for (int i = 0; i < N - 1; i++) {
String[] strArr = br.readLine().split(" ");
Integer parent = Integer.parseInt(strArr[0]);
Integer child = Integer.parseInt(strArr[1]);
if(strArr[2].equals("R")){
populateMapForRightNode(parent,child,nodeMap);
}else{
populateMapForLeftNode(parent,child,nodeMap);
}
}
for (int i = 0; i < N - 1; i++) {
String[] strArr = br.readLine().split(" ");
Integer parent = Integer.parseInt(strArr[0]);
Integer child = Integer.parseInt(strArr[1]);
if(strArr[2].equals("R")){
populateMapForRightNode(parent,child,nodeMap1);
}else{
populateMapForLeftNode(parent,child,nodeMap1);
}
}
Node root = nodeMap.get(1);
nodeMap=null;
Node root1 = nodeMap1.get(1);
nodeMap1=null;
boolean isMirrorBinaryTrees = isMirrorTree(root,root1);
if(isMirrorBinaryTrees)
System.out.printf("yes");
else
System.out.printf("no");
}
public static boolean isMirrorTree(Node tree, Node mirrorTree) {
if( null == tree && null == mirrorTree)
return true;
if( null == tree || null == mirrorTree)
return false;
if(tree.item != mirrorTree.item)
return false;
if(false == isMirrorTree(tree.left,mirrorTree.right))
return false;
if(false == isMirrorTree(tree.right,mirrorTree.left))
return false;
return true;
}
private static void populateMapForRightNode(Integer parent,Integer child,Map<Integer, Node> nodeMap){
if(nodeMap.get(parent)==null){
Node node = new Node(parent);
node.right = new Node(child);
nodeMap.put(parent,node);
nodeMap.put(child,node.right);
}else{
Node node = nodeMap.get(parent);
node.right = new Node(child);
nodeMap.put(child,node.right);
}
}
private static void populateMapForLeftNode(Integer parent,Integer child,Map<Integer, Node> nodeMap){
if(nodeMap.get(parent)==null){
Node node = new Node(parent);
node.left = new Node(child);
nodeMap.put(parent,node);
nodeMap.put(child,node.left);
}else{
Node node = nodeMap.get(parent);
node.left = new Node(child);
nodeMap.put(child,node.left);
}
}
private static class Node{
public int item;
public Node left;
public Node right;
public Node(int item){
this.item = item;
}
}
}