// 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 addNodeAtEnd(clsNode* pNewNode) { if(pHeadNode == NULL) { pHeadNode = pNewNode; } else { //find last node clsNode* pNodeCopy = pHeadNode ; clsNode* pNodeLast = pNodeCopy; while(pNodeCopy != NULL) { pNodeLast = pNodeCopy; pNodeCopy = pNodeCopy->pNext; } pNodeLast->pNext = pNewNode ; } } void addNodeAtIndex(clsNode* pNewNode,int intIndex) { if(pHeadNode == NULL && intIndex !=0) { cout << "Given index is not available into current linklist\n"; } else { //find last node clsNode* pNodeCopy = pHeadNode ; clsNode* pNodeReq = pNodeCopy; int intIteration = 0; bool isToAdd = false; while(pNodeReq != NULL) { if(intIteration==intIndex) { isToAdd = true; break; } intIteration++; pNodeReq = pNodeCopy; pNodeCopy = pNodeCopy->pNext; } if(isToAdd ) { pNewNode->pNext = pNodeReq ; } else { cout << "Given index is not available into current linklist\n"; } } } }; string compare(clsLinkedList L1,clsLinkedList L2) { start: if (L1.pHeadNode != NULL && L2.pHeadNode != NULL ) { cout << "value from both list are : " << L1.pHeadNode->intData << "\t"<< L2.pHeadNode->intData << endl; if(L1.pHeadNode->intData==L2.pHeadNode->intData) { L1.pHeadNode=L1.pHeadNode->pNext; L2.pHeadNode= L2.pHeadNode->pNext ; goto start; } else { return "No"; } } else if (L1.pHeadNode == NULL && L2.pHeadNode == NULL ) { return "Yes"; } else { return "No"; } return "Yespp"; } int main() { clsLinkedList L1; clsLinkedList L2; L1.addNode(new clsNode(4)); L1.addNode(new clsNode(3)); L1.addNode(new clsNode(2)); L1.addNode(new clsNode(1)); L2.addNodeAtEnd(new clsNode(1)); L2.addNodeAtEnd(new clsNode(2)); L2.addNodeAtEnd(new clsNode(3)); L2.addNodeAtEnd(new clsNode(40)); L2.addNodeAtIndex(new clsNode(5),0); //Display first linked list cout << "L1 Linked List :" << endl; L1.display(); //Display second linked list cout << "L2 Linked List :" << endl; L2.display(); //compare two list cout << "Is L1 and L2 same list?: \n"; cout << compare(L1,L2); return 0; }

CompareTwoLinkedlist