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

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

一行搞定，遍历也可以，这样更简单