Count Complete Tree Nodes LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countNodes(TreeNode *root) {
4
    if (root == nullptr) return 0;
5

6
    int left = countNodes(root->left);
7
    int right = countNodes(root->right);
8

9
    return 1 + left + right;
10
  }
11
};