fork download
  1. class Node(object):
  2. def __init__(self, data, next):
  3. self.data = data
  4. self.next = next
  5.  
  6. D = Node(4, None)
  7. C = Node(3, D)
  8. B = Node(2, C)
  9. A = Node(1, B)
  10.  
  11. E = Node(5,None)
  12. F = Node(6,None)
  13.  
  14. def insert(nodeX, nodeY):
  15. pass
  16.  
  17.  
  18. def pre_insert(nodeX, nodeY):
  19. pass
  20.  
  21.  
  22. def printlist():
  23. tmp = A
  24. print("data is")
  25. while tmp.next is not None:
  26. print(tmp.data)
  27. tmp = tmp.next
  28. print(tmp.data)
  29.  
  30. printlist() # 1 , 2, 3, 4
  31.  
  32. insert(C, E)
  33. printlist() # 1, 2, 3, 5, 4
  34.  
  35. pre_insert(C, F)
  36. printlist() # 1, 2, 6, 3, 5, 4
Success #stdin #stdout 0.07s 14100KB
stdin
Standard input is empty
stdout
data is
1
2
3
4
data is
1
2
3
4
data is
1
2
3
4