Delete a node | : carlos labs :

Hackerrank Challenges - Delete a node

"Data Structures" can be difficult to grasp when you are starting to code, but I promise: they are important to master.

#!/bin/python3

import math
import os
import random
import re
import sys

class SinglyLinkedListNode:
    def __init__(self, node_data):
        self.data = node_data
        self.next = None

class SinglyLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None

def insert_node(self, node_data):
        node = SinglyLinkedListNode(node_data)

if not self.head:
            self.head = node
        else:
            self.tail.next = node

self.tail = node

def print_singly_linked_list(node, sep, fptr):
    while node:
        print(str(node.data))

node = node.next

if node:
            print(sep)

def deleteNode(head, position):
    thisNode = head
    ix=0
    while thisNode:
        if (ix>=position):
            if (thisNode.next is not None):
                thisNode.data = thisNode.next.data
            if (thisNode.next.next is None):
                thisNode.next = None
                break

thisNode = thisNode.next
        ix+=1            
    return head

if __name__ == '__main__':

llist_count = int(input())

llist = SinglyLinkedList()

for _ in range(llist_count):
        llist_item = int(input())
        llist.insert_node(llist_item)

position = int(input())

llist1 = deleteNode(llist.head, position)

print_singly_linked_list(llist1, ' ', ' ')