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

题目链接：222. 完全二叉树的节点个数

需复刷

全代码：

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