蔡子经数据结构5.10

#include <string.h>
#include <stdlib.h>

typedef struct 
{
    int ltag;
    char data;
    int rchild;
} node;
#define MAXN 8
node a[MAXN] =
{
    {0,'A',4},
    {1,'B',2},
    {0,'D',-1},
    {1,'F',-1},
    {0,'C',-1},
    {0,'E',-1},
    {1,'G',7},
    {1,'H',-1}
};

typedef struct TreeNode
{
    char data;
    struct TreeNode *lchild, *rchild;
} TNode;

TNode* createNode()
{
    TNode *ret = (TNode*)malloc(sizeof(TNode));
    ret->lchild = ret->rchild = NULL;
    return ret;
}

TNode* createTree(int cur)
{
    TNode *ret = createNode();
    ret->data = a[cur].data;
    if(a[cur].ltag == 0)
        ret->lchild = createTree(cur+1);
    if(a[cur].rchild != -1)
        ret->rchild = createTree(a[cur].rchild);
    return ret;
}

void MidOrder(TNode *rt)
{
    if(rt == NULL) return;
    MidOrder(rt->lchild);
    putchar(rt->data);
    MidOrder(rt->rchild);
}

int main()
{
    TNode *root = createTree(0);
    MidOrder(root);
    return 0;
}