题解 | #完全二叉树结点数#

#使用二叉树广搜遍历即可
from collections import deque

class Solution:
    def nodeNum(self , head: TreeNode) -> int:
        # write code here
        if head == None:
            return 0
        que = deque([head])
        result = 1
        while que:
            for _ in range(len(que)):
                node = que.popleft()
                if node.left != None:
                    que.append(node.left)
                    result+=1
                if node.right != None:
                    que.append(node.right)
                    result+=1
        return result