cc 2.3

deleteNode.py

#2.3 Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.

from LinkedList import LinkedList, Node

def deleteNode(node):
    if node is None or node.next is None:
        return False
    node.data = node.next.data
    node.next = node.next.next
    return True

#test
a = Node('a')
b = Node('b')
c = Node('c')
d = Node('d')
a.next = b
b.next = c
c.next = d
test = LinkedList(a,d)
test.printList()
deleteNode(c)   
print 'after delete c,the list is' 
test.printList()