// any thoughts are most welcome and would appreciate your feedback to make this code more optimized... #include using namespace std; class clsNode { public: int intData;//data storage clsNode* pNext;//next elment pointer clsNode(int ival) //constructor { intData = ival; pNext = NULL; } }; class clsLinkedList { public: clsNode* pHeadNode; clsLinkedList()//constructor { pHeadNode = NULL; } void addNode(clsNode* pNewNode) { pNewNode->pNext = pHeadNode ; pHeadNode = pNewNode ; } void display() { clsNode* pNodeCopy = pHeadNode ; while(pNodeCopy != NULL) { cout << pNodeCopy->intData; cout << endl; pNodeCopy = pNodeCopy->pNext; } } }; void removeDuplicate(clsNode* pHeadNode) { clsNode* pNodeCopy = pHeadNode ; while(pNodeCopy != NULL) { int intCurData = pNodeCopy->intData; clsNode* pTempNode = pNodeCopy->pNext; if(pTempNode!=NULL) { int intNextData = pTempNode ->intData; if(intCurData==intNextData) { pNodeCopy->pNext = pTempNode ->pNext; } else { pNodeCopy=pTempNode; } } else { pNodeCopy=pTempNode; } } } int main() { clsLinkedList L; L.addNode(new clsNode(4)); L.addNode(new clsNode(3)); L.addNode(new clsNode(3)); L.addNode(new clsNode(2)); L.addNode(new clsNode(2)); L.addNode(new clsNode(2)); L.addNode(new clsNode(1)); //Display first linked list cout << "Linked List as it is :" << endl; L.display(); //remove from list removeDuplicate(L.pHeadNode); //Display second linked list cout << "Linked List after removal :" << endl; L.display(); return 0; }

DeleteDuplicateFromSortedLinkedList