222. 完全二叉树的节点个数 - 力扣(LeetCode)
递归,没什么好解释的
class Solution {
public:
int countNodes(TreeNode* root) {
if(!root)
return 0;
return countNodes(root->left) + countNodes(root->right) + 1;
}
};
迭代,层序遍历,用queue来存节点;
没有用到完全二叉树的性质;
class Solution {
public:
int countNodes(TreeNode* root) {
queue<TreeNode*> que;
if (root != NULL) que.push(root);
int rs = 0;
while(!que.empty())
{
int size = que.size();
for(int i = 0; i < size; i++)
{
TreeNode* node = que.front();
que.pop();
rs++;
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
}
return rs;
}
};