|All-time Popular Problems|
|Delete keys in a Linked list|
|Delete Middle of Linked List|
|Max sum in the configuration|
|Given a linked list of 0s, 1s and 2s, sort it.|
|Top View of Binary Tree|
|Linked List Insertion|
|Boundary Traversal of binary tree|
|n'th node from end of linked list|
Given a sorted doubly linked list and an element X, your task is to complete the function sortedInsert(), that insert's the value in Doubly linked list in sorted way.
Example: Initial doubly linked list: Doubly Linked List after insertion of 9:
The function takes two arguments as input, reference pointer to the head of the doubly linked list and an element X.
There will be T test cases and for each test case the function will be called separately.
For each test print the space separated vales of the doubly linked list.
1 9 16 25 78
1 2 3
1 2 9 16 25 78
1 2 3 5
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.