| 35 | from collections import deque |
| 36 | |
| 37 | class Solution(object): |
| 38 | def levelOrderBottom(self, root): |
| 39 | """ |
| 40 | :type root: TreeNode |
| 41 | :rtype: List[List[int]] |
| 42 | """ |
| 43 | if not root: |
| 44 | return [] |
| 45 | |
| 46 | result = [] |
| 47 | |
| 48 | temp = deque([root]) |
| 49 | next_temp = deque() |
| 50 | _result = [] |
| 51 | while 1: |
| 52 | if temp: |
| 53 | node = temp.popleft() |
| 54 | _result.append(node.val) |
| 55 | if node.left: |
| 56 | next_temp.append(node.left) |
| 57 | |
| 58 | if node.right: |
| 59 | next_temp.append(node.right) |
| 60 | else: |
| 61 | result.append(_result) |
| 62 | _result = [] |
| 63 | temp = next_temp |
| 64 | next_temp = deque() |
| 65 | |
| 66 | if not temp and not next_temp: |
| 67 | if _result: |
| 68 | result.append(_result) |
| 69 | return result[::-1] |
nothing calls this directly
no outgoing calls
no test coverage detected