LinkedList/merge_sorted_lists library

🔗 Merge Sorted Linked Lists Algorithms

Efficient algorithms for merging two sorted linked lists into a single sorted linked list. Includes both iterative and recursive approaches.

Time Complexity: O(n + m) where n and m are the lengths of the lists Space Complexity: O(1) for iterative, O(n + m) for recursive

Functions

mergeKSortedLists<T extends Comparable>(List<LinkedListNode<T>?> lists) → LinkedListNode<T>?

Merges K sorted linked lists efficiently

mergeSortedLists<T extends Comparable>(LinkedListNode<T>? list1, LinkedListNode<T>? list2) → LinkedListNode<T>?

Merges two sorted linked lists iteratively

mergeSortedListsInPlace<T extends Comparable>(LinkedListNode<T>? list1, LinkedListNode<T>? list2) → LinkedListNode<T>?

Merges two sorted linked lists in-place (modifies the original lists)

mergeSortedListsRecursive<T extends Comparable>(LinkedListNode<T>? list1, LinkedListNode<T>? list2) → LinkedListNode<T>?

Merges two sorted linked lists recursively

mergeSortedListsWithComparator<T>(LinkedListNode<T>? list1, LinkedListNode<T>? list2, int comparator(T, T)) → LinkedListNode<T>?

Merges two sorted linked lists with custom comparator