forked from adityabisoi/ds-algo-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
90 lines (66 loc) · 2.03 KB
/
solution.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#!/bin/python3
import math
import os
import random
import re
import sys
class DoublyLinkedListNode:
def __init__(self, node_data):
self.data = node_data
self.next = None
self.prev = None
class DoublyLinkedList:
def __init__(self):
self.head = None
self.tail = None
def insert_node(self, node_data):
node = DoublyLinkedListNode(node_data)
if not self.head:
self.head = node
else:
self.tail.next = node
node.prev = self.tail
self.tail = node
def print_doubly_linked_list(node, sep, fptr):
while node:
fptr.write(str(node.data))
node = node.next
if node:
fptr.write(sep)
# Sorted Insert Function
def sortedInsert(head, data):
newNode=DoublyLinkedListNode(data)
if head==None: # if Linked List is empty
head=newNode
elif head.data>=newNode.data: # if Node is to be inserted at start
newNode.next=head
head.prev=newNode
head=newNode
else: # if Node is to be inserted at any further position
temp=head
while temp.next is not None and data>temp.next.data:
temp=temp.next
if temp.next==None: # inserting at last
temp.next=newNode
newNode.prev=temp
else:
next=temp.next
temp.next=newNode
newNode.prev=temp
newNode.next=next
next.prev=newNode
return head
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
t = int(input())
for t_itr in range(t):
llist_count = int(input())
llist = DoublyLinkedList()
for _ in range(llist_count):
llist_item = int(input())
llist.insert_node(llist_item)
data = int(input())
llist1 = sortedInsert(llist.head, data)
print_doubly_linked_list(llist1, ' ', fptr)
fptr.write('\n')
fptr.close()