spacepaste

Paste details

reply | raw

Z8SLacSv.py

  1.  
  2. <function Tree.__len__.<locals>.<lambda> at 0x7fe558fca598>
  3. <__main__.Tree object at 0x7fe558fcfb70> <__main__.Tree object at 0x7fe558fcfc18> 3
  4. 1
  5. <__main__.Tree object at 0x7fe5598725f8> <__main__.Tree object at 0x7fe558fbec88> 2
  6. 1
  7. None None 1
  8. 1
  9. None None 1
  10. Traceback (most recent call last):
  11. File "../decompiler.py", line 219, in <module>
  12. tree()
  13. File "../decompiler.py", line 61, in tree
  14. print(len(t))
  15. File "../decompiler.py", line 56, in __len__
  16. return self.preorder(function=lambda data, d : 1, join=lambda l,r,c : ((0 if l is None else l) + (0 if r is None else r) + c))
  17. File "../decompiler.py", line 20, in preorder
  18. l = self.left.preorder(function, depth+1)
  19. File "../decompiler.py", line 20, in preorder
  20. l = self.left.preorder(function, depth+1)
  21. File "../decompiler.py", line 26, in preorder
  22. return join(l,r,c)
  23. TypeError: 'int' object is not callable
  24.  

7YtNyaTx.py

  1.  
  2. class Tree:
  3. def __init__(self, data=None, left=None, right=None):
  4. self.left = left
  5. self.right = right
  6. self.data = data
  8. def preorder(self, function=lambda data, d : None, join=lambda l,r,c : None, depth=0):
  9. print(join)
  10. l = None
  11. r = None
  12. print(self.left, self.right, self.data)
  13. if self.left is not None:
  14. l = self.left.preorder(function, depth+1)
  15. if self.right is not None:
  16. r = self.left.preorder(function, depth+1)
  17. c = function(self.data, depth)
  18. print(join)
  19. print(l,r,c)
  20. return join(l,r,c)
  22. def inorder(self, function=lambda data, d : None, join=lambda l,r,c : None, depth=0):
  23. l = None
  24. r = None
  25. if self.left is not None:
  26. l = self.left.preorder(function, depth+1)
  27. c = function(self.data, depth)
  28. if self.right is not None:
  29. r = self.left.preorder(function, depth+1)
  30. return join(l,r,c)
  32. def postorder(self, function=lambda data, d : None, join=lambda l,r,c : None, depth=0):
  33. l = None
  34. r = None
  35. c = function(self.data, depth)
  36. if self.left:
  37. l = self.left.preorder(function, depth+1)
  38. if self.right:
  39. r = self.left.preorder(function, depth+1)
  40. return join(l,r,c)
  42. def __len__(self):
  43. # def join(left, right, curr):
  44. # sum = curr
  45. # if left is not None:
  46. # sum += left
  47. # if right is not None:
  48. # sum += right
  49. # return sum
  50. return self.preorder(function=lambda data, d : 1, join=lambda l,r,c : ((0 if l is None else l) + (0 if r is None else r) + c))
  53. def tree():
  54. t = Tree(3, Tree(2, Tree(1), Tree(4)), Tree(5, Tree(6), Tree(7)))
  55. print(len(t))
  56.  
Powered by spacepaste. Paste removal.