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

思路：

1. 层序遍历的思路去做。每取出一个节点，计数一次就好了。
2. 递归。先求左孩子节点数量，再求右孩子节点数量，+1是+上中间节点。

int countNodes(struct TreeNode* root){
    if(root==NULL)
        return 0;
    struct TreeNode *queue[100000];
    struct TreeNode *cur;
    int front = 0,rear=0;
    int count = 0;
    queue[rear++] = root;
    while(front!=rear){
        int last = rear;
        int size = last - front ;
        for(int i = 0;i <size ; i++){
            cur = queue[front++];
            count++;
            if(cur->left !=NULL)
                queue[rear++] = cur->left;
            if(cur->right !=NULL)
                queue[rear++] = cur->right;
        }
    }
    return count;
}

int count(struct TreeNode *Node){
    if(Node==0)
        return 0;
    int leftNum = count(Node->left);
    int rightNum= count(Node->right);
    int total = leftNum + rightNum + 1;
    return total;
}

int countNodes(struct TreeNode* root){
    return count(root);
}