Inserting a Node Into a Sorted Doubly Linked List
Problem Statement :
Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function in the editor below. sortedInsert has two parameters: DoublyLinkedListNode pointer head: a reference to the head of a doubly-linked list int data: An integer denoting the value of the data field for the DoublyLinkedListNode you must insert into the list. Returns DoublyLinkedListNode pointer: a reference to the head of the list Note: Recall that an empty list (i.e., where head = NULL ) and a list with one element are sorted lists. nput Format The first line contains an integer t, the number of test cases. Each of the test case is in the following format: The first line contains an integer n, the number of elements in the linked list. Each of the next n lines contains an integer, the data for each node of the linked list. The last line contains an integer, data , which needs to be inserted into the sorted doubly-linked list.
Solution :
Solution in C :
In C++ :
/*
Insert Node in a doubly sorted linked list
After each insertion, the list should be sorted
Node is defined as
struct Node
{
int data;
Node *next;
Node *prev
}
*/
Node* SortedInsert(Node *head,int data)
{
// Complete this function
// Do not write the main method.
Node *current = NULL;
Node *new_node = (Node*)malloc(sizeof(Node));
new_node->data=data;
new_node->next=NULL;
new_node->prev=NULL;
if (head == NULL )
{
head = new_node;
}
else if(head->data >= new_node->data)
{
new_node->next = head;
head->prev=new_node;
head = new_node;
}
else
{
current = head;
while (current->next!=NULL && current->next->data < new_node->data)
{
current = current->next;
}
if(current->next!=NULL)
{
new_node->next = current->next;
current->next->prev=new_node;
}
current->next = new_node;
new_node->prev=current;
}
return head;
}
In Java :
/*
Insert Node at the end of a linked list
head pointer input could be NULL as well for empty list
Node is defined as
class Node {
int data;
Node next;
Node prev;
}
*/
Node SortedInsert(Node head,int data) {
Node n= new Node();
n.data=data;
n.next=null;
n.prev=null;
if(head==null)
return n;
if(head.data > data)
{
n.next=head;
head.prev=n;
return n;
}
Node temp=head;
while(temp.next!=null)
{
if(temp.next.data > data)
{
n.next=temp.next;
n.prev=temp.next.prev;
temp.next=n;
n.next.prev=n;
return head;
}
temp=temp.next;
}
temp.next=n;
n.prev=temp;
return head;
}
In python3 :
"""
Insert a node into a sorted doubly linked list
head could be None as well for empty list
Node is defined as
class Node(object):
def __init__(self, data=None, next_node=None, prev_node = None):
self.data = data
self.next = next_node
self.prev = prev_node
return the head node of the updated list
"""
def SortedInsert(head, data):
new = Node(data=data)
tmp = head
while tmp.data <= data and tmp.next != None and tmp.next.data <= data:
tmp = tmp.next
new.prev = tmp
new.next = tmp.next
tmp.next = new
if new.next != None:
new.next.prev = new
return head
In C :
// Complete the sortedInsert function below.
/*
* For your reference:
*
* DoublyLinkedListNode {
* int data;
* DoublyLinkedListNode* next;
* DoublyLinkedListNode* prev;
* };
*
*/
DoublyLinkedListNode* sortedInsert(DoublyLinkedListNode* head, int data) {
DoublyLinkedListNode *New = create_doubly_linked_list_node(data);
if (!head)
{
head = New;
return head;
}
else if (data < (head->data))
{
New->next = head;
head->prev = New;
New->prev = NULL;
head = New;
return head;
}
else
{
DoublyLinkedListNode *temp = head;
while ( ((temp->next) != NULL) && ((temp->next->data) <= data))
temp = temp->next;
if (temp->next != NULL)
{
DoublyLinkedListNode *next = temp->next;
next->prev = New;
New->next = next;
}
else
New->next = NULL;
temp->next = New;
New->prev = temp;
}
return head;
}
View More Similar Problems
Mr. X and His Shots
A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M
View Solution →Jim and the Skyscrapers
Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space
View Solution →Palindromic Subsets
Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t
View Solution →Counting On a Tree
Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n
View Solution →Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →