Leetcode 每日一题
题目链接: 222. 完全二叉树的节点个数
难度: 中等
解题思路: 对二叉树进行层次遍历,每遍历到一个节点,记录数量。
题解:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def countNodes(self, root: TreeNode) -> int:
if root == None:
return 0
queue = []
queue.append(root)
cnt = 0
# 层次遍历
while queue:
node = queue.pop(0)
if node.left:
queue.append(node.left)
if node.right:
queue.append(node.right)
cnt += 1
return cnt