Data Structure and algorithms ( in Java ) Please solve it urgent basis: Make a programe in Java with complete comments detail and attach outputs image: Question is inside the image also: a). Write a function to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows: Insert 50 List:- 50 Insert 40 List:- 40 50 Insert 25 List:- 25 40 50 Insert 35 List:- 25 35 40 50 Insert 40 List:- 25 35 40 40 50 Insert 70 List:- 25 35 40 50 70
Data Structure and algorithms ( in Java )
Please solve it urgent basis:
Make a programe in Java with complete comments detail and attach outputs image:
Question is inside the image also:
a). Write a function to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows:
Insert 50 List:- 50
Insert 40 List:- 40 50
Insert 25 List:- 25 40 50
Insert 35 List:- 25 35 40 50
Insert 40 List:- 25 35 40 40 50
Insert 70 List:- 25 35 40 50 70
b). Write a program to merge two sorted linked lists (implemented in part a) 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


Step by step
Solved in 3 steps with 1 images









