| 31 | insert(Tree, element) |
| 32 | return Tree |
| 33 | class Solution(object): |
| 34 | def postorderTraversal(self, root): |
| 35 | if not root: |
| 36 | return [] |
| 37 | res = [] |
| 38 | stack = [[root,0]] |
| 39 | while stack: |
| 40 | node = stack[-1] |
| 41 | stack.pop() |
| 42 | if node[1]== 0 : |
| 43 | current = node[0] |
| 44 | stack.append([current,1]) |
| 45 | if current.right: |
| 46 | stack.append([current.right,0]) |
| 47 | if current.left: |
| 48 | stack.append([current.left,0]) |
| 49 | else: |
| 50 | if node[0].data != 0: |
| 51 | res.append(node[0].data) |
| 52 | return res |
| 53 | |
| 54 | ob = Solution() |
| 55 | root = make_tree([-10,9,10,None,None,15,7]) |
no outgoing calls
no test coverage detected