完全二叉树的节点个数---leetcode 222题

目标成为slam大神

已于 2022-05-21 10:24:42 修改

阅读量52

点赞数

分类专栏：数据结构与算法学习记录

于 2022-05-21 10:17:47 首次发布

本文链接：https://blog.csdn.net/m0_50046535/article/details/124894466

版权

leetcode 算法

数据结构与算法学习记录专栏收录该内容

79 篇文章 2 订阅

订阅专栏

解法1：递归法

/**
 * 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 getNodes(TreeNode* root) {
        if(root == NULL) return 0;
        int leftnum = getNodes(root->left);
        int rightnum = getNodes(root->right);
        int nodes = leftnum + rightnum +1;
        return nodes;
    }
    int countNodes(TreeNode* root) {
        return getNodes(root);
    }
};

解法2：迭代法

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

解法3，完全二叉树法

/**
 * 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 == nullptr) return 0;
        TreeNode* left = root->left;
        TreeNode* right = root->right;
        int leftHeight = 0, rightHeight = 0;
        while(left){
            left = left->left;
            leftHeight++;
        }
        while(right){
            right = right->right;
            rightHeight++;
        }
        if(leftHeight == rightHeight){
            return (2 << leftHeight) - 1;
        }
        return countNodes(root->left) +countNodes(root->right) +1;
    }
};