[Leetcode] 655. Print Binary Tree

方法1

BFS: get level traverse from BFS
get the rule of node position in each level

from collections import deque
# 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 printTree(self, root: TreeNode) -> List[List[str]]:
        levels = []
        queue = deque([root])
        while self.valid(queue):
            print('valid')
            curt_level = []
            for i in range(len(queue)):
                node = queue.popleft()
                curt_level.append(node)
                if node is None:
                    queue.append(None)
                    queue.append(None)
                else:
                    queue.append(node.left)
                    queue.append(node.right)
            levels.append(curt_level)
        print(levels)
        length = len(levels)
        width = sum([len(level) for level in levels])
        res = [[''] * width for i in range(length)]
        for i in range(length):
            start = 2 ** (length - 1 - i) - 1
            delta = 2 ** (length - i)
            for j in range(len(levels[i])):
                if levels[i][j]:
                    value = levels[i][j].val
                    res[i][start] = str(value)
                start += delta
        return res
    
    def valid(self, queue):
        for ele in queue:
            if ele is not None:
                return True
        return False