Q1.
Given main.cpp and linkedlist.h (where list ADT is defined), this problem requires you to complete the implementation of list ADT, which is saved into the file linkedlist.cpp. You can test the validity of your implementation by testing if main.cpp can be successfully runned and the output satisfies the expectation. You may refer to the code in notes, however it is highly suggested you can implement the empty functions by your own code.
Q2.
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. Uncomment and finish the blank function in main.cpp
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4 */
Notice: You should submit both your code (.h .cpp) and the compiled executable file (.exe)
Reviews
There are no reviews yet.