求二叉树的节点数

#include<iostream>
using namespace std;
struct Node{
    Node *lchild;
    Node *rchild;
    char data;
};

Node *create(Node *bt)
{
    char c;
    cin >>c;
    if(c=='#')
      bt=NULL;
    else{
        bt = new Node;
        bt->data=c;
        bt->lchild=create(bt->lchild);
        bt->rchild=create(bt->rchild);
    }
    return bt;
}

int getnodenum(Node *bt)
{
    if(bt==NULL)
      return 0;
    else{
        return getnodenum(bt->rchild)+getnodenum(bt->lchild)+1;
    }
}

int main()
{
    Node *bt;
    bt=create(bt);
    cout << getnodenum(bt)  <<endl;
    return 0;
}