建立二叉树的二叉链表存储结构（严6.70）--------西工大noj

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct TreeNode
{
    char data;
    struct TreeNode *LChild, *RChild;
}TreeNode;
void Create(TreeNode **T, char *s, int len)
{
    if(len==1)
    {
        (*T) = (TreeNode*)malloc(sizeof(TreeNode));
        (*T)->data = s[0];
        (*T)->LChild = NULL;
        (*T)->RChild = NULL;
    }
    else
    {
        (*T) = (TreeNode*)malloc(sizeof(TreeNode));
        (*T)->data = s[0];
        s += 2;
        len -= 3;
        char *s1, *s2;
        int len1, len2;
        {
            char *p = s;

            int len_cnt = 0;
            int cnt = 0;
            while(len_cnt < len)
            {
                if(*p=='(')
                    cnt++;
                else if(*p == ')')
                    cnt--;


                if(cnt == 0 && *p == ',')
                    break;
                p++;
                len_cnt++;
            }
            s1 = s;
            len1 = len_cnt;
            s2 = s1 + len1 + 1;
            len2 = len - len1-1;
        }
        Create(&(*T)->LChild, s1,len1);
        Create(&(*T)->RChild, s2,len2);

    }

}
void Tran(TreeNode * T)
{
    if(!T)
        return;
    printf("%c",T->data);
    Tran(T->LChild);
    Tran(T->RChild);
}
int main()
{
    static char s[10000];
    scanf("%s",s);
    TreeNode *T;
    Create(&T, s, strlen(s));
    Tran(T);
    return 0;
}
/*
A(B(#,D),C(E(#,F),#))
*/