前言
题目: 222. 完全二叉树的节点个数
文档: 代码随想录——完全二叉树的节点个数
编程语言: C++
解题状态: 简简单单
思路
简单的二叉树层序遍历。
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int countNodes(TreeNode* root) {
queue<TreeNode*> q;
int res = 0;
if (root != NULL) q.push(root);
while (!q.empty()) {
TreeNode* node = q.front();
q.pop();
res++;
if (node -> left) q.push(node -> left);
if (node -> right) q.push(node -> right);
}
return res;
}
};