/******************************************************************/
//树的递归思想,把每个节点当作是一棵树,以后序遍历为例
//步骤1:访问左子树.2访问右子树3.打印当前节点的值
//在节点遍历时如果某节点没有左节点或者是右节点是传递的指针是NULL
//说明下一步没有树了可以返回
/******************************************************************/
typedef char data_node;
typedef struct NODE
{
struct NODE *l_node,*r_node;
data_node value;
} node;
/******************************************************************/
//function:preordertraverse a bitree and printf the value in every node
//argument:pointer to the frist node of this bitree
/******************************************************************/
int preordertraversal(node *pointer)
{
if(NULL == pointer) //is a new bitree? if not, return.
return 0;
else
{
//print it's value before ,print it's child tree
printf("%c ",pointer->value); //print value of this node
preordertraversal(pointer->l_node); //enter left tree
preordertraversal(pointer->r_node); //enter right tree
}
return 0;
}
/******************************************************************/
//function:inordertraverse a bitree and printf the value in every node
//argument:pointer to the frist node of this bitree
/******************************************************************/
int inordertraversal(node *pointer)
{
if(NULL == pointer)
return 0;
else
{
inordertraversal(pointer->l_node); //enter left tree
//In this time ,left childtree blong this node was traversed,and we can print it's value
printf("%c ",pointer->value); //print value of this node
inordertraversal(pointer->r_node); //enter right tree
}
return 0;
}
/******************************************************************/
//function:postordertraverse a bitree and printf the value in every node
//argument:pointer to the frist node of this bitree
/******************************************************************/
int postordertraversal(node *pointer)
{
if(NULL == pointer)
return 0;
else
{
postordertraversal(pointer->l_node); //enter left tree
postordertraversal(pointer->r_node); //enter right tree
//In this time , two childtree blong this node was traversed,and we can print it's value
printf("%c ",pointer->value); //print value of this node
}
return 0;
}
/******************************************************************/
//function:creat a new bitree
//argument:pointer to a char array contain many node and these nodes according to the preorder traversal is saved.
{
static int i=0; //静态存储防止递归调用时丢失上一次调用后i所指的a数组的位置
node *pointer;
data_node value;
if('*' == (value = a[i++]))
return NULL;
else
{
pointer = (node *)malloc(sizeof(node)); //创建该节点
pointer->value = value; //先为该节点赋值
pointer->l_node = creat_bitree(a); //创建该节点的左子树
pointer->r_node = creat_bitree(a); //创建该节点的右子树
}
//In this time,new bitree tree was be created and now return the point to this bitree to user. or last node
return pointer;
}
//树的递归思想,把每个节点当作是一棵树,以后序遍历为例
//步骤1:访问左子树.2访问右子树3.打印当前节点的值
//在节点遍历时如果某节点没有左节点或者是右节点是传递的指针是NULL
//说明下一步没有树了可以返回
/******************************************************************/
typedef char data_node;
typedef struct NODE
{
struct NODE *l_node,*r_node;
data_node value;
} node;
/******************************************************************/
//function:preordertraverse a bitree and printf the value in every node
//argument:pointer to the frist node of this bitree
/******************************************************************/
int preordertraversal(node *pointer)
{
if(NULL == pointer) //is a new bitree? if not, return.
return 0;
else
{
//print it's value before ,print it's child tree
printf("%c ",pointer->value); //print value of this node
preordertraversal(pointer->l_node); //enter left tree
preordertraversal(pointer->r_node); //enter right tree
}
return 0;
}
/******************************************************************/
//function:inordertraverse a bitree and printf the value in every node
//argument:pointer to the frist node of this bitree
/******************************************************************/
int inordertraversal(node *pointer)
{
if(NULL == pointer)
return 0;
else
{
inordertraversal(pointer->l_node); //enter left tree
//In this time ,left childtree blong this node was traversed,and we can print it's value
printf("%c ",pointer->value); //print value of this node
inordertraversal(pointer->r_node); //enter right tree
}
return 0;
}
/******************************************************************/
//function:postordertraverse a bitree and printf the value in every node
//argument:pointer to the frist node of this bitree
/******************************************************************/
int postordertraversal(node *pointer)
{
if(NULL == pointer)
return 0;
else
{
postordertraversal(pointer->l_node); //enter left tree
postordertraversal(pointer->r_node); //enter right tree
//In this time , two childtree blong this node was traversed,and we can print it's value
printf("%c ",pointer->value); //print value of this node
}
return 0;
}
/******************************************************************/
//function:creat a new bitree
//argument:pointer to a char array contain many node and these nodes according to the preorder traversal is saved.
/******************************************************************/
//假设我们用二叉树前序遍历的思维,遍历结果保存在数组中,将printf打印改成malloc创建节点即可 ,
//注意:在遍历过程中如果当前节点没有左子树或者是右子树就用×代替,以达到给递归创造返回条件的效果
node *creat_bitree(char a[]){
static int i=0; //静态存储防止递归调用时丢失上一次调用后i所指的a数组的位置
node *pointer;
data_node value;
if('*' == (value = a[i++]))
return NULL;
else
{
pointer = (node *)malloc(sizeof(node)); //创建该节点
pointer->value = value; //先为该节点赋值
pointer->l_node = creat_bitree(a); //创建该节点的左子树
pointer->r_node = creat_bitree(a); //创建该节点的右子树
}
//In this time,new bitree tree was be created and now return the point to this bitree to user. or last node
return pointer;
}