题解 | #判断是不是完全二叉树#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
#
# @param root TreeNode类
# @return bool布尔型
#
class Solution:
    def isCompleteTree(self, root: TreeNode) -> bool:
        # write code here
        queue = []
        queue.append(root)
        Flag=False
        while queue:
            node = queue.pop(0)
            if not node:
                Flag=True
            else:
                if Flag:
                    return False
                queue.append(node.left)
                queue.append(node.right)
        return True