_1490.java

packagecom.fishercoder.solutions.secondthousand;

importcom.fishercoder.common.classes.Node;
importjava.util.HashMap;
importjava.util.LinkedList;
importjava.util.Map;
importjava.util.Queue;

publicclass_1490 {
publicstaticclassSolution1 {
publicNodecloneTree(Noderoot) {
if (root == null) {
returnroot;
 }
Map<Node, Node> map = newHashMap<>();
map.put(root, newNode(root.val));
Queue<Node> queue = newLinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
Nodecurr = queue.poll();
for (Nodechild : curr.children) {
NodechildCopy = newNode(child.val);
if (!map.containsKey(child)) {
map.put(child, childCopy);
queue.offer(child);
 }
map.get(curr).children.add(childCopy);
 }
 }
returnmap.get(root);
 }
 }
}