int dfs(TreeNode *n){
if(n == nullptr){
return 0;
}else{
return dfs(n->left) + dfs(n->right) + (n->left != nullptr) + (n->right != nullptr);
}
}
int countNodes(TreeNode* root) {
return dfs(root) + (root != nullptr);
}