981统计利用二叉树存储的森林中树的棵数

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

void CreatTree(BTNode *&tree)
{
    char ch;
    cin >> ch;
    tree = new BTNode;
    if (ch == ‘#‘)
        tree = NULL;
    else
    {
        tree->data = ch;
        CreatTree(tree->lchild);
        CreatTree(tree->rchild);
    }
}
void Forest(BTNode *tree, int &treeCount)
{
    while (tree != NULL)
    {
        treeCount++;
        tree = tree->rchild;
    }
}
void DestoryTree(BTNode *&tree)
{
    if (tree != NULL)
    {
        DestoryTree(tree->lchild);
        DestoryTree(tree->rchild);
        delete tree;
    }
}
int main()
{
    BTNode *tree;
    CreatTree(tree);
    int treeCount = 0;
    Forest(tree, treeCount);
    cout << treeCount;
    DestoryTree(tree);
    system("pause");
    return 0;
}