Question: Write a function to merge two linked lists. The input lists have their elements in sorted order, from smallest to highest. The output list should
Write a function to merge two linked lists. The input lists have their elements in sorted order, from smallest to highest. The output list should also be sorted from highest to lowest. Your algorithm should run in linear time on the length of the output list.
Step by Step Solution
3.30 Rating (162 Votes )
There are 3 Steps involved in it
To merge two linked lists with elements in sorted order from smallest to highest and output a sorted list from highest to lowest in linear time you ca... View full answer
Get step-by-step solutions from verified subject matter experts
