Python Program To Check If Two Linked Lists Are Identical
Two Linked Lists are identical when they have the same data and the arrangement of data is also the same. For example, Linked lists a (1->2->3) and b(1->2->3) are identical. . Write a function to check if the given two linked lists are identical.
Method 1 (Iterative):
To identify if two lists are identical, we need to traverse both lists simultaneously, and while traversing we need to compare data.
Time Complexity: O(n)
Method 2 (Recursive):
Recursive solution code is much cleaner than iterative code. You probably wouldn’t want to use the recursive version for production code, however, because it will use stack space which is proportional to the length of the lists.
Time Complexity: O(n) for both iterative and recursive versions. n is the length of the smaller list among a and b.
Auxiliary Space: O(n) for call stack because using recursion
Approach 3: Hash Table:
- Another approach is to compare two linked lists is a hash table or a set. The idea is to traverse the first linked list and insert each node’s value into the hash table or set.
- Then, traverse the second linked list and check if each node’s value exists in the hash table or set. If a node’s value is not found in the hash table or set, then the linked lists are not identical.
Here’s a simple Python Code that uses a hash table (unordered_set) to compare two linked lists:
Time Complexity: O(n) where n is the length of the smaller list among a and b.
Space complexity: O(n), where n is the number of elements stored in the table.
Please refer complete article on Identical Linked Lists for more details!
Please Login to comment...