树的定义
typedef struct node {
int data;
struct node * left, *right, *parent;
}Node, *Tree;
树的遍历
前序遍历
void pre_order(Tree t){
if(t){
printf("pre order: %d.\n", t->data);
pre_order(t->left);
pre_order(t->right);
}
}
中序遍历
void middle_order(Tree t){
if(t){
middle_order(t->left);
printf("middle order: %d.\n", t->data);
middle_order(t->right);
}
}
后序遍历
void post_order(Tree t){
if(t){