树的程序

a . h 

# Pragma once 

# include < stdio . h >

# include < stdlib . h >

 typedef char TreeTypeData;

 typedef struct TreeNode

 {TreeTypeData data ;

 struct TreeNode * lchild; 

 struct TreeNode * rchild;

}TN;

 TN * creatNode (TreeTypeData x);

 void insertNode (TN * parentNode,TN * lchild,TN * rchild)

void printCurNodeData ( TN * cur );

void priOrder ( TN * root ); 

void midOrder ( TN * root ); 

void behindOrder ( TN * root );

 

b.c

# include " a . h "

 TN * creatNode ( TreeeeTypeData x)

 {TN * newnode =( TN *) malloc (sizeof ( TN ));

newnode -> data = x ;

newnode -> lchild = NULL;

newnode -> rchild = NULL ;

return newnode ;

void insertNode ( TN * parentNode , TN *lchild,TN*rchild )

 {parentNode ->lchild =lchild ;

 parentNode -> rchild =rchild ;

}

void printCurNodeData ( TN *Cur ){

printf ("%c", cur -> data ); 

printf (" ");

}

 void priOrder ( TN * root )

 {if ( root != NULL)

 {printCurNodeData ( root );

 priOrder ( root ->lchild );

 priOrder ( root ->rchild );

}

}

void midOrder ( TN * root ){

 if ( root !=NULL ){

 midOrder ( root ->lchild ); printCurNodeData ( root );

 midOrder ( root ->rchild );

}

}

 void behindOrder ( TN * root ){

 if ( root != NULL ){

 behindOrder ( root -> lchild );

printCurNodeDate ( root );

behindOrder ( root -> rchild );

}

}