【数据结构】算法9.15 键树-双链树-查找

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

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2

typedef int Status;
typedef int ElemType;

#define MAXKEYLEN 16    //max length of keyword
typedef struct
{
    char ch[MAXKEYLEN];  //keyword
    int num;   //keyword length
}KeysType;    //keyword type

typedef enum{LEAF,BRANCH}NodeKind;  //node tyoe:{leaf,branch}
typedef char Record;
typedef struct DLTNode
{
    char symbol;
    struct DLTNode *next;  //pointer point to brother node
    NodeKind kind;  //分支结点的孩子链指针
    union{
        Record *infoptr;  //叶子结点的记录指针
        struct DLTNode *first;  //分支结点的孩子链指针
    };
}DLTNode,*DLTree;
/*******************************声明部分****************************************/
Record *SearchDLTree(DLTree T,KeysType K);
//在非空双链树T中查找关键字等于K的记录，若存在，则返回指向该记录的指针，否则NULL
Status InitDLTree(DLTree *T);
//初始化双链树
void PrintKeys(DLTree T);
//打印双链树
/*******************************函数部分****************************************/
Record *SearchDLTree(DLTree T,KeysType K)
{
    DLTree p;
    int i;

    p = T->first;
    i = 0;
    while(p && i < K.num){
        while(p && p->symbol != K.ch[i])
            p = p->next;
        if(p && i < K.num-1)
            p = p->next;
        ++i;
    }
    if(!p)
        return NULL;
    else
        return p->infoptr;
}

Status InitDLTree(DLTree *T)
{
    *T = (DLTree)malloc(sizeof(DLTNode));
    (*T)->symbol = '\0';
    (*T)->next = NULL;
    (*T)->first = NULL;
}

void PrintKeys(DLTree T)
{
    if(T){
        if(T->symbol == '\0')
            PrintKeys(T->first);
        else if(T->symbol == '$')
            printf("%s ",T->infoptr);
        else
            PrintKeys(T->first);
        PrintKeys(T->next);
    }
}

/*******************************主函数部分**************************************/
int main()
{
    DLTree T;
    KeysType k = {"CAI",3};

    InitDLTree(&T);
 //   PrintKeys(T);
    printf("%s ",SearchDLTree(T,k));
}