Linked List | Merge Two Sorted Linked List | Data Structure & Algorithm | Hindi

Linked List | Merge Two Sorted Linked List | Data Structure & Algorithm | Hindi
Leetcode Question Link : leetcode.com/p...
Intuition
Okay, so I'm given two sorted linked lists, and I need to merge them into a single sorted linked list. The key here is to compare the values of nodes from the two lists and merge them in a way that maintains the sorted order.
Approach
Here's how I'm approaching this problem:
If one of the lists is empty, then I can simply return the other list because it's already sorted.
I compare the values of the current nodes from the two lists.
I take the smaller node and connect it to the next node, which is found by calling the mergeTwoLists function recursively.
I repeat this process until I reach the end of one of the lists.
Complexity
Time complexity: The time complexity of this approach is O(m + n), where m and n are the lengths of the two linked lists. This is because in each recursive call, I either connect a node from the first list or a node from the second list, and I do this until one of the lists is exhausted.
Space complexity: The space complexity is O(m + n) as well. This is due to the recursion stack. In the worst case, I may have m + n recursive calls on the stack.

[@SriramulaVenkataKrishnaKarthik]

never stop

[@kartikeyahere]

Thank you..means a lot 😊