Leetcode222.完全二叉树的节点个数-代码随想录

meeiuliuus

已于 2024-05-08 23:01:15 修改

阅读量441

点赞数 8

分类专栏： # leetcode --- easy 文章标签：算法

于 2024-01-30 09:58:16 首次发布

本文链接：https://blog.csdn.net/qq_52313711/article/details/135926428

版权

leetcode --- easy 专栏收录该内容

80 篇文章 0 订阅

订阅专栏

题目：

代码（首刷自解 2024年1月30日）：

class Solution {
public:
    int countNodes(TreeNode* root) {
        int res = 0;
        if (root == nullptr) return res;
        queue<TreeNode*> deque;
        TreeNode* cur = root;
        deque.push(cur);
        int size = 0;
        while (!deque.empty()) {
            size = deque.size();
            while (size--) {
                TreeNode* node = deque.front();
                deque.pop();
                res++;
                if (node->left) deque.push(node->left);
                if (node->right) deque.push(node->right);
            }
        }
        return res;
    }
};

代码（首刷看解析根据完全二叉树性质迭代）

class Solution {
public:
    int countNodes(TreeNode* root) {
        if (root == nullptr) return 0;
        TreeNode* left = root->left;
        TreeNode* right = root->right;
        int leftDepth = 0;
        int rightDepth = 0;

        while (left) {
            left = left->left;
            leftDepth++;
        }
        while (right) {
            right = right->right;
            rightDepth++;
        }

        if (leftDepth == rightDepth) {
            return (2 << leftDepth) - 1;
        }
        return countNodes(root->left) + countNodes(root->right) + 1;
    }
};

代码（二刷自解 2024年5月8日）

class Solution {
public:
    int countNodes(TreeNode* root) {
        if (!root) return 0;
        return countNodes(root->left) + countNodes(root->right) + 1;
    }
};