初步理解二叉树代码的简单框架
递归模型:
先序遍历优先级:当前节点---->左子树------>右子树
中序遍历优先级:左子树------>当前节点---->右子树
后序遍历优先级:左子树------>右子树---->当前节点
队列模型:
层次遍历优先级:从上到下
访问根节点并输出,判断是否有左右孩子,左孩子优先级大于右孩子,若有则入队,在判断队列是否为空,若不为空则出队,访问该出队的结点重复判断。若队列为空则遍历完毕。
#include <stdio.h>
#include <stdlib.h>
//业务结点
typedef struct NODE_ST{
int value;
}node_st;
//树的模型,包含业务结点
typedef struct D_TREE{
node_st cur;
struct D_TREE *lchild,*rchild;
}d_tree;
//先序遍历
void preOrder(d_tree *node)
{
if(node == NULL)
return;
printf("%d\n",node->cur.value);
preOrder(node->lchild);
preOrder(node->rchild);
}
//中序遍历
void inOrder(d_tree *node)
{
if(node == NULL)
return;
inOrder(node->lchild);
printf("%d\n",node->cur.value);
inOrder(node->rchild);
}
//后序遍历
void postOrder(d_tree *node)
{
if(node == NULL)
return;
postOrder(node->lchild);
postOrder(node->rchild);
printf("%d\n",node->cur.value);
}
//层次遍历
void level_order(d_tree *t)
{
linkqueue_onode *q;
init_linkqueue(&q); //初始化链式队列
while(t != NULL){
printf("%d\n",t->data);
if(t->lchild != NULL)
in_linkqueue(t->lchild, q);
if(t->rchild != NULL)
in_linkqueue(t->rchild, q);
if(!is_empty_linkqueue(q))
out_linkqueue(q, &t);
else
break;
}
}
int main()
{
d_tree *node;
int i = 0;
node = (d_tree *)calloc(5,sizeof(d_tree));
for(i = 0; i<5; i++){
node[i].cur.value = i;
}
//建立树的模型
node[0].lchild = (d_tree *)&node[1];
node[0].rchild = (d_tree *)&node[2];
node[1].lchild = (d_tree *)&node[3];
node[2].rchild = (d_tree *)&node[4];
//打印遍历结果
printf("preOrder\n");
preOrder(&node[0]);
printf("inOrder\n");
inOrder(&node[0]);
printf("postOrder\n");
postOrder(&node[0]);
return 0;
}
输出结果
preOrder
0
1
3
2
4
inOrder
3
1
0
2
4
postOrder
3
1
4
2
0