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

题目

代码

class Solution {
public:
    int dfs(TreeNode* root){
        if(root == NULL) return 0;
        int left = dfs(root->left);  //左
        int right = dfs(root->right); //右
        return left + right + 1; //中
    }
    int countNodes(TreeNode* root) {
        return dfs(root);
    }
};