leetcode/solution/107_Binary_Tree_Level_Order_Traversal_II.py at master · CodexploreRepo/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        if (root):
            result = self.breathFirstSearch([root], [])
            return result
        else:
            return []

    def breathFirstSearch(self, queue, result):
        if (len(queue)==0):
            return result
        #Total number of node in the current level
        size = len(queue)
        #Create a list contains Nodes in current level
        currentLevel = []
        for i in range(0, size):
            #Popout the first item in the queue
            currentNode = queue.pop(0)
            #Push into the current Level List
            currentLevel.append(currentNode.val)

            #Append the children of currentNode to the queue, which will be next Level
            if (currentNode.left):
                queue.append(currentNode.left)
            if (currentNode.right):
                queue.append(currentNode.right)

        #print(currentLevel)
        result.insert(0,currentLevel)
        return self.breathFirstSearch(queue, result)