Question

C++

You're given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. The lists are equal only if they have the same number of nodes and corresponding nodes contain the same data. Either head pointer given may be null meaning that the corresponding list is empty. Input Format You have to complete the int CompareLists (Node headA, Node* head B) method which takes two arguments - the heads of the two linked lists to compare. You should NOT read any input from stdin/console. The input is handled by the code in the editor and the format is as follows: The first line contains t, the number of test cases. The format for each test case is as follows: The first line contains an integer n. denoting the number of elements in the first linked list. The next n lines conta in an integer each, denoting the elements of the first linked list. The next line contains an integer m. denoting the number of elements in the second linked list The next m lines contain an integer each, denoting the elements of the second linked list. Constraints 1st10 1n 1000 1000, where list is the th element in 1list the list.

Answer 1

Solution:-

According to your question, I just provide compare_lists function and, for your better understanding I will provide the screenshot of sample code where compare_lists function is used to compare the two lists.

Algo. for Compare Two Lists:-

1. Traverse both lists parallelly and check each list should not be NULL
2. Check each data value of each list should be equal.
3. Repeat 1 and 2 step untile the list not became to NULL
4. Finally, check if both lists are NULL then it is equal other wise it is not equal.

Code for Function:-

bool compare_lists(SinglyLinkedListNode *head1, SinglyLinkedListNode *head2)
{
   while (head1 != NULL && head2 != NULL)
   {
       if (head1->data != head2->data)
           return false;
       head1 = head1->next;
       head2 = head2->next;
   }
   return (head1 == NULL && head2 == NULL);
}