蔡子经数据结构6.2

#include <stdlib.h>
typedef struct  ;
struct 
{
    int val,mark;
    node *lchild,*rchild;
};
#define MAXN 100
int a[MAXN] = {1,2,3,4,5,6,7};

node* createNode()
{
    node *rt = (node*)malloc(sizeof(node));
    rt->lchild = rt->rchild = NULL;
    rt->val = rt->mark = 0;
    return rt;
}

node *createTree(int l, int r)
{
    if(l > r) return NULL;
    int mid = (l+r)/2;
    node *rt = createNode();
    rt->val = a[mid];
    rt->lchild = createTree(l, mid-1);
    rt->rchild = createTree(mid+1, r);
    return rt;
}

void InOrder(node *rt)
{
    if(rt == NULL) return;
    InOrder(rt->lchild);
    printf("%d ",rt->val);
    InOrder(rt->rchild);
}

int main()
{
    node* root = createTree(0, 6);
    InOrder(root);
    puts("");
    return 0;
}