In [23]:

    

#2-3 Delet middle node,
from linked_list import LinkedList
def dmn(ll,node):
    if node == None or node.next==None:
        return False
    nodenext = node.next
    node.data = nodenext.data
    node.next = nodenext.next
    print ll


    

In [29]:

    

ll = LinkedList()
ll.insert(2)
ll.insert(4)
ll.insert(6)
ll.insert(7)
ll.insert(1)
print ll


    

    




->1->7->6->4->2

In [30]:

    

node = ll.head.next.next


    

In [32]:

    

dmn(ll,node)


    

    




->1->7->4->2

In [ ]: