133. Clone Graph 8Apr

class Solution {
public:
    Node* cloneGraph(Node* node) {
        if(!node) return node;
        unordered_map<Node*,Node*> m;
        Node* ans = new Node(node->val,{});
        m[node]=ans;
        queue<Node*> q;
        q.push(node);
        while(!q.empty()){
            Node* currNode=q.front();
            q.pop();
            vector<Node*> neigh = currNode->neighbors;
            for(auto x:neigh){
                if(m.find(x)==m.end()){
                    m[x] = new Node(x->val,{});
                    q.push(x);
                }
                m[currNode]->neighbors.push_back(m[x]);
            }
        }
        return ans;
    }
};