222. 完全二叉树的节点个数

题目描述

点这里

思路分析

二叉树+递归/dfs
提供一种巧妙的终止条件

代码实现

/**
 * 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;
        auto l=root->left,r=root->right;
        int levell=1,levelr=1;
        while(l) l=l->left,levell++;
        while(r) r=r->right,levelr++;
        if(levelr==levell) return (1<<levelr)-1;
        else return countNodes(root->left)+countNodes(root->right)+1;
    }
};