나무 아이 형제 노드

#include <iostream>
using namespace std;

typedef struct CSNode
{
    char        data;
    struct CSNode * firstchild , * nextsibling ;
}* CSTree;


//====================================================
#define MAXSIZE 10
CSTree    q[MAXSIZE];
int count=0;
    
// 
void init_cstree(CSTree &tree)
{
    
    tree->firstchild = NULL;
    tree->nextsibling = NULL;
}

// 
void creat_cstree(CSTree &T)
{

    FILE *fin=fopen(" .txt","r");  
    char fa=' ',ch=' ';
    for( fscanf(fin,"%c%c",&fa,&ch); ch!='#'; fscanf(fin,"%c%c",&fa,&ch) ) 
    {      
        CSTree p=(CSTree)malloc(sizeof(CSTree)); 
        init_cstree(p);
        p->data=ch;
        q[++count]=p;

        if('#' == fa)
            T=p;
        else
        {
            CSTree s = (CSTree)malloc(sizeof(CSTree));
            int i;
            for(i=1;i<=MAXSIZE;i++)
            {
                if(q[i]->data == fa)    
                {
                    s=q[i];
                    break;
                }
            }
             if(! (s->firstchild) )        // 
                s->firstchild=p;
            else        // 
            {
                CSTree temp=s->firstchild;
                while(NULL != temp->nextsibling)
                {
                    temp=temp->nextsibling;
                }
                temp->nextsibling=p;
            }
        }
    } 
    fclose(fin);
}
// 
void print_cstree(CSTree &tree)
{
        cout<<tree->data<<"  ";
        if(tree->firstchild!=NULL)
            print_cstree(tree->firstchild);
        if(tree->nextsibling!=NULL)
            print_cstree(tree->nextsibling);
}
// 
//void allpath_tree()
int main()
{
    CSTree    cstree;
    cstree=(CSTree)malloc(sizeof(CSTree));
    init_cstree(cstree);
    creat_cstree(cstree);
    // 
    print_cstree(cstree);
    cout<<endl;
    return 0;
}