蔡子经数据结构5.8

#include <stdlib.h>
typedef struct  ;
struct 
{
    int val,mark;
    node *lchild,*rchild;
};
#define MAXN 100

node* createNodeWithVal(int val)
{
    node *rt = (node*)malloc(sizeof(node));
    rt->lchild = rt->rchild = NULL;
    rt->val = val;
    rt->mark = 0;
    return rt;
}
/*
      4
  2       6
1   3   5   7
*/
node* createTree()
{
    node *rt = createNodeWithVal(4);
    rt->lchild = createNodeWithVal(2);
    rt->rchild = createNodeWithVal(6);
    rt->lchild->lchild = createNodeWithVal(1);
    rt->lchild->rchild = createNodeWithVal(3);
    rt->rchild->lchild = createNodeWithVal(5);
    rt->rchild->rchild = createNodeWithVal(7);
    return rt;
}

int flag = 0;
void Judge(node *rt)
{
    if(rt == NULL) return;
    Judge(rt->lchild);
    Judge(rt->rchild);
    if((rt->lchild == NULL && rt->rchild != NULL)
       || (rt->lchild != NULL && rt->rchild == NULL))
    {
        flag = 1;
        return;
    }
}

int main()
{
    node *root = createTree();
    Judge(root);
    printf("%dn",flag);
    return 0;
}