1.    def insertAfterNode(self, newNode, item):
2.          current = self.head
3.          found = False
4.          while current and found is False:  #Search for item
5.              if current.getInfo() == item:
6.                  found = True
7.              else:
8.                  current = current.getNext()
9.          if found is True:
10.           if current == self.last:  #Node insert at the end
11.                newNode.neat = None
12.                self.last = newNode
13.           else:
14.                newNode.next = current.next
15.                current.next.pre = newNode
16.           newNode.pre = current
17.           current.next = newNode
18.           self.size += 1
19.         return found