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

 

int countNodes(struct TreeNode* root){
    return (root)?countNodes(root->left)+countNodes(root->right)+1 :0;
}