Let and be two sorted linked lists (in increasing order). 1. Write a pseudocode...

Transcribed Image Text:

Let ₁ and ₂ be two sorted linked lists (in increasing order). 1. Write a pseudocode that merges the two linked lists into a sorted linked list (that contains the union of their elements). 2. Provide pseudocode to deal with the following situation: the first element of l₂ is not the minimal one in the list (all other elements are in increasing order). Let ₁ and ₂ be two sorted linked lists (in increasing order). 1. Write a pseudocode that merges the two linked lists into a sorted linked list (that contains the union of their elements). 2. Provide pseudocode to deal with the following situation: the first element of l₂ is not the minimal one in the list (all other elements are in increasing order).

Answer rating: 100% (QA)

Certainly heres the pseudocode for both scenarios 1 Merging two sorted linked lists into a new sorted linked list pseudocode function mergeSortedLists... View the full answer