Merge() two sorted linked lists and return it as a new list. The new list should
be made by splicing together the nodes of the first two lists.
For example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
Also, create a separate test file linked_list_test.py in dsalgo/tests for this issue using python unittest (testing framework) Which contain tests for existing linked_list.py included merge().
Things need to be done for this issue:
[ ] Add a merge() in existing linked_list.py
[ ] Write tests using Unittest framework for complete file i.e linked_list.py
Merge() two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. For example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4
Also, create a separate test file linked_list_test.py in dsalgo/tests for this issue using python unittest (testing framework) Which contain tests for existing linked_list.py included merge().
Things need to be done for this issue:
[ ] Add a merge() in existing linked_list.py
[ ] Write tests using Unittest framework for complete file i.e linked_list.py