tstree.h

多重搜索树算法

#ifndef _TS_TREE_H_
#define _TS_TREE_H_
typedef struct tsTreeNode *TSTptr;

/*
 * The value stored at the node is splitchar, 
 * and the three pointers represent the three children. 
 * The root of the tree is declared to be TSTptr root. 
 * We will represent every character in each string, 
 * including the null character that terminates it.
 */
typedef struct tsTreeNode {
   char splitchar; 
   TSTptr lokid, eqkid, hikid; 
} TSTnode;

#endif