typedef struct node
 {
     char data;
     struct node *lchild, *rchild;
 } BTNode;

 void CreateBTree(BTNode *&b, char *str)
 {
     BTNode *St[MaxSize], *p = NULL;
     , ch, k, j = ;
     b = NULL;
     ch = str[j];
     while (ch != '\0')
     {
         switch (ch)
         {
         ; break;
         ; break;
         case ')': --top; break;
         default: p = (BTNode*)malloc(sizeof(BTNode));
             p->data = ch;  p->lchild = p->rchild = NULL;
             if (b == NULL)
                 b = p;
             else
             {
                 switch (k)
                 {
                 : St[top]->lchild = p; break;
                 : St[top]->rchild = p; break;
                 }
             }
         }
         ++j;
         ch = str[j];
     }
 }

 void DispBTree(BTNode *b)
 {
     if (b != NULL)
     {
         printf(" %c", b ->data);
         if (b->lchild != NULL || b->rchild != NULL)
         {
             printf("(");
             DispBTree(b->lchild);
             if (b->rchild != NULL)
                 printf(",");
             DispBTree(b->rchild);
             printf(")");
         }
     }
 }

 int HeightBTree(BTNode *b)
 {
     if (b != NULL)
     {
         int i = HeightBTree(b->lchild);
         int j = HeightBTree(b->rchild);
         ) : (j + ));
     }
     ;
 }

 int Nodes(BTNode *b)
 {
     if (b == NULL)
         ;
     else if (b->lchild == NULL && b->rchild == NULL)
         ;
     else
         );
 }

 int LeafNodes(BTNode *b)
 {
     if (b == NULL)
         ;
     else if (b->lchild == NULL && b->rchild == NULL)
         ;
     else
         return (LeafNodes(b->lchild) + LeafNodes(b->rchild) );
 }

#include<stdio.h>
#include<malloc.h>
#define MaxSize 100
typedef struct node
{
    char data;
    struct node *lchild, *rchild;
} BTNode;

void CreateBTree(BTNode *&b, char *str)
{
    BTNode *St[MaxSize], *p = NULL;
    , ch, k, j = ;
    b = NULL;
    ch = str[j];
    while (ch != '\0')
    {
        switch (ch)
        {
        ; break;
        ; break;
        case ')': --top; break;
        default: p = (BTNode*)malloc(sizeof(BTNode));
            p->data = ch;  p->lchild = p->rchild = NULL;
            if (b == NULL)
                b = p;
            else
            {
                switch (k)
                {
                : St[top]->lchild = p; break;
                : St[top]->rchild = p; break;
                }
            }
        }
        ++j;
        ch = str[j];
    }
}

void DispBTree(BTNode *b)
{
    if (b != NULL)
    {
        printf(" %c", b ->data);
        if (b->lchild != NULL || b->rchild != NULL)
        {
            printf("(");
            DispBTree(b->lchild);
            if (b->rchild != NULL)
                printf(",");
            DispBTree(b->rchild);
            printf(")");
        }
    }
}

int HeightBTree(BTNode *b)
{
    if (b != NULL)
    {
        int i = HeightBTree(b->lchild);
        int j = HeightBTree(b->rchild);
        ) : (j + ));
    }
    ;
}

int Nodes(BTNode *b)
{
    if (b == NULL)
        ;
    else if (b->lchild == NULL && b->rchild == NULL)
        ;
    else
        );
}

int LeafNodes(BTNode *b)
{
    if (b == NULL)
        ;
    else if (b->lchild == NULL && b->rchild == NULL)
        ;
    else
        return (LeafNodes(b->lchild) + LeafNodes(b->rchild) );
}

int level(BTNode *b)
{

}

int main()
{
    BTNode *b;
    int h;
    char str[] = "A(B(D(G, H)),C(E(,I), F)";
    CreateBTree(b, str);
    printf("二叉树：");
    DispBTree(b); printf("\n");
    h = HeightBTree(b);
    printf("二叉树的高度为：%d\n", h);

    h = Nodes(b);
    printf("节点个数： %d\n", h);
    h = LeafNodes(b);
    printf("叶子节点个数： %d\n", h);
    ;

}