Remove Duplicates from Linked Lir

node.rem.duplicates.cpp

void removeDuplicates(Node* node)
{
    Node* n = node;
    std::set<Node*, Node_Comparable> nodeSet;
    nodeSet.insert(n);
    while (n->next != NULL)
    {
        std::pair<std::set<Node*>::iterator, bool> ret = nodeSet.insert(n->next);
        if (ret.second) // element not there
        {
            // Good enough. 
            LOG ("removeDuplicates: Added " << n->next->data);
        }
        else // already exists. Let's remove this
        {
            LOG ("removeDuplicates: Found duplicate......... " << n->next->data);
            Node* nextNext = n->next->next;
            delete n->next;
            n->next = nextNext;
        }
        n = n->next;
    }
}