#include using namespace std; struct node { int data; node *next; }; node *head1=NULL; node *head2=NULL; node *current1=NULL; node *current2=NULL; void CompareLists(node *headA, node *headB); ///pass in both heads of both lists to compare void IsEmpty(node *headA, node *headB); ///Checks whether lists are empty void AddNode(int data, int choice) { ///data into first list if(choice==1) { node *n=new node; n->data=data; n->next=NULL; if(head1!=NULL) ///if item in list { current1=head1; while(current1->next!=NULL) { current1=current1->next; ///traverse down to next node } current1->next=n; } else { head1=n; } } ///data into second list else if(choice==2) { node *n=new node; n->data=data; n->next=NULL; if(head2!=NULL) { current2=head2; while(current2->next!=NULL) { current2=current2->next; } current2->next=n; } else { head2=n; } } } void CompareLists(node *headA, node *headB) { current1=headA; current2=headB; while(current1!=NULL && current2!=NULL) { current1=current1->next; ///traverse current2=current2->next; if(current1->data!=current2->data) { cout<<"List not equivalent } else { cout<<"List is equivalent"<data<<" "; ///print data of current node current1=current1->next; ///advance to next node } cout<data<<" "; current2=current2->next; ///advance to next node } cout<>choice; switch(choice) { case 1: cout<>data; AddNode(data,choice); cout<>data; AddNode(data,choice); cout<

Compare two Linked lists