DS二叉树--叶子数量

#include <string>
#include <string.h>
#include <queue>
#include <iostream>
using namespace std;
 
class Node
{
public:
    char data;
    Node *left, *right;
    Node(){}
    ~Node()
    {
        delete left;
        delete right;
    }
};
 
static int i = 0;
Node *creattree(string str)
{
    Node *p = new Node;
    if(str[i] == '0')
    {
        p = NULL;
    }
    else
    {
        p->data = str[i];
        i++;
        p->left = creattree(str);
        i++;
        p->right = creattree(str);
    }
    return p;
}
 
void func(Node *p, int &num)
{
    if(p)
    {
    if(p->left == NULL && p->right == NULL)
    {
        num++;
    }
    else
    {
        func(p->left, num);
        func(p->right, num);
    }
    }
}
int main()
{
    int T, num = 0;
    string str;
    Node *p = NULL;
    cin >> T;
    while(T--)
    {
        num = 0;
        i = 0;
        cin >> str;
        p = creattree(str);
        func(p, num);
        cout << num << endl;
        delete p;
    }
    return 0;
}