doubleinsert

Source: "https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list/problem"

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 into a sorted linked 
list while maintaining the sort.

Code:

#function

def sortedInsert(head, data):
    nnode = DoublyLinkedListNode(data)
    if head == None:
        return nnode
    elif data<head.data:
        nnode.next = head
        head.prev = nnode
        return nnode
    else:
        nnode = sortedInsert(head.next, data)
        head.next = nnode
        nnode.prev = head
        return head

#Complete Code

#!/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)

# Complete the sortedInsert function below.

#
# For your reference:
#
# DoublyLinkedListNode:
#     int data
#     DoublyLinkedListNode next
#     DoublyLinkedListNode prev
#
#
def sortedInsert(head, data):
    nnode = DoublyLinkedListNode(data)
    if head == None:
        return nnode
    elif data<head.data:
        nnode.next = head
        head.prev = nnode
        return nnode
    else:
        nnode = sortedInsert(head.next, data)
        head.next = nnode
        nnode.prev = head
        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()