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

# 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
        list_tree = [root]
        find = False
        while list_tree:
            t = []
            for i in list_tree:
                if not find :
                    if i.left != None :
                        t.append(i.left)
                        if i.right != None:
                            t.append(i.right)
                        else:
                            find = True
                    else:
                        if i.right != None:
                            return False
                        find = True
                else:
                    if i.left != None or i.right != None:
                        return False
            list_tree = t
        return True