222.完全二叉树的节点个数(层序、后序)

最新推荐文章于 2024-09-22 21:37:03 发布

Stdleohao

最新推荐文章于 2024-09-22 21:37:03 发布

阅读量123

点赞数

分类专栏： leetcode 文章标签：二叉树 leetcode 算法

本文链接：https://blog.csdn.net/stdleohao/article/details/119673528

版权

leetcode 专栏收录该内容

71 篇文章 0 订阅

订阅专栏

题目链接

/**
 * 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) {
        if (!root) return 0;
        queue<TreeNode*> que;
        que.push(root);
        int resNum = 0;
        int size;
        TreeNode* node;
        while (!que.empty()) {
            size = que.size();
            for (int i = 0; i < size; i++) {
                node = que.front();
                que.pop();
                resNum++;
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);
            
            }
        }
        return resNum;
    }
};

 // 后序递归
class Solution {
public:
    int countNodes(TreeNode* root) {
        if (!root) return 0;
        int leftNum = countNodes(root->left);
        int rightNum = countNodes(root->right);
        return 1 + leftNum + rightNum; 
    }
};