nt nodes of the two lists, choose smaller to add to the result), but where that version removed an element from input queue and added to result queue, the linked list merge detaches a node from the input list and attaches it to the result list.  The trickiness comes in managing the pointers as you traverse the input lists and re-wire the nodes.</li>
      <li>When you add a node to the result list, it needs to be placed at the end to maintain sorted order. Tracking a tail pointer will be helpful!</li>
     